【摘 要】
：
Let G be a connected graph and g a non-negative integer,the g-extra connectivity of G is the minimum cardinality of a set of vertices in G,if it exists,whos
【机 构】
：
BeijingJiaotongUniversity,P.R.China
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
Let G be a connected graph and g a non-negative integer,the g-extra connectivity of G is the minimum cardinality of a set of vertices in G,if it exists,whose deletion disconnects G and leaves each remaining component with more than g vertices.
其他文献
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
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
In this talk,we give formulas for resistance distances and Kirchhoff indices of some composite graphs,and obtain formulas for the Kirchhoff index,Laplacian-
Being motivated in terms of mathematical concepts from the theory of electrical networks,Klein and Ivanciuc introduced and studied a new graph-theoretic cyc
It is well-known that the n-dimensional hypercube Qn is one of the most versatile and efficient interconnection network architecture yet discovered for buil
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with lengths at most k.The linear k-arboricity of G,denoted by lak(
Some sharp bounds of the adjacency spectral radius,the Laplacian spectral radius,the signless Laplacian spectral radius,the distance spectral radius,the dis
1993年,Klein和Randi(c)提出了图的电阻距离的概念,且指出电阻距离是定义在图上距离函数,是图的重要的不变量。对于一些复杂图来说,计算其电阻距离非常困难。文中定义了
An edge k-weighting of a graph G is a function φ:E(G)→{1,2…,k}.An edge k-weighting is proper if ∑e(∈)uφ(u)≠∑e(∈)vφ(v)for every uv∈E(G).
Let A(G),L(G)and Q(G)be the adjacency tensor,Laplacian tensor and signless Laplacian tensor of r-graph G,respectively.Denote by λ(T) the largest Heigenvalu