【摘 要】
：
Let G be a graph,and let A(G)denote the adjacency matrix of G.The permanental polynomial of G is defined as π(G,x)=per(xI-A(G)).The permanental spectrum of
【机 构】
：
QinghaiNationalitiesUniversity,Xining,P.R.China
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
Let G be a graph,and let A(G)denote the adjacency matrix of G.The permanental polynomial of G is defined as π(G,x)=per(xI-A(G)).The permanental spectrum of G,is the collection of all roots(together with their multiplicities)of π(G,x).
其他文献
The convolution array is a matrix whose nth column is the n-fold convolution for the 0th column.In this talk,we evaluate two truncated determinants of convo
阐述(V,R)-语言、(V,R)-半群、拟简单图以及拟严格有向图等概念,建立(V,R)-语言、(V,R)-半群、互联网络与拟简单图、拟严格有向图以及随机图的关系,进而,以上领域互为工
A perfect matching cover of a graph G is a set of perfect matchings of G such that each edge of G is contained in at least one member of it.Berge conjecture
Many classical graph partitioning problems ask for partitions of a graph(or a hypergraph)that optimize a single quantity.In judicious partitioning problems,
In this paper we deduce a necessary and sufficient condition for those graphs whose Mycielski graphs are planar.In addition,we deduce a necessary and suffic
An edge-colored graph H is called rainbow if e(H)= c(H),where e(H)is the number of edges in G and c(H)is the number of colors used.The rainbow number rb(G,H
A group is called 2-genetic if each normal subgroup of the group can be generated by two elements.For an odd prime p and a positive integer n,let G be a non
Let G be a graph with vertex set V(G)and edge set E(G).The first generalized multiplicative Zagreb index of G is defined as ∏1;c(G)=∏v∈V(G)d(v)c for a re
A strong edge coloring is an edge coloring such that every color class is an induced matching.In other words,every path with three edges has three distinct
Let G be a graph with m edges.The subdivision graph(S)(G)of G is the graph obtained by inserting a new vertex into every edge of G.Denote by I(G)the set of