【摘 要】
：
Let G =(V, E) be a simple graph with vertex set V ={v1, v2,..., vn} and edge set E =E(G).The adjacency matrix of G is defined to be a matrix A(G) =(aij), wh
论文部分内容阅读
Let G =(V, E) be a simple graph with vertex set V ={v1, v2,..., vn} and edge set E =E(G).The adjacency matrix of G is defined to be a matrix A(G) =(aij), where aij =1 if vi is adjacent to vj, and aij =0 otherwise.The degree matrix of G is denoted by D(G) =diag(d(v1),d(v2),...,d(v,n)), where d(v) denotes the degree of a vertex v in the graph G.
其他文献
Let Gσbe a weighted oriented graph with skew adjacency matrix S(Gσ).For an n × n real skew symmetric matrix S, the weighted oriented graph as-sociated to
For a graph G and two positive integers j and k, an m-L(j, k)-edge-labeling of G is an assignment on the edges to the set {0, 1, 2,..., m}, such that adjace
如果一个图存在定向满足其最大出度△+不超过最大度△的一半，则通过估计图的半边路径(semi-edge walk)的个数，得到了该图的无符号拉普拉斯谱半径的一个新上界.进而根据D.Go
Based on the generalized Schensted algorithm due to White (Adv.Math.(1983)), in this report we present a one-to-one correspondence between oscillating m-rim
An adjacent vertex distinguishing total coloring of a graph G , or avd-total coloring in short, is a proper total coloring of G such that any pair of adjace
Tutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow.In this paper, we show that this conjecture is true for Cayley graphs on ge
Given n items with different sizes si and profits pi, m knapsacks with different capacities cj and a restricted bipartite graph G =(S ∪ T, E), where each v
Let Jn,β denote the set of trees on n vertices with fixed matching number β, where n =kβ + l(k ≥ 2).In this paper, the tree with minimal Laplacian radiu
Let F be a field of characteristic not equal to 2.We describe the relation between the non-negative dimensional Milnor-Witt K-theory of F and the tensor alg
A star forest is a forest whose components are stars.The star arboricity of a graph G, denoted by sa(G), is the minimum number of edge-disjoint star forests