【摘 要】
：
There are various matrices that can be associated with graphs.Recently,the results about the Q-spectrum of a graph has been studied extensively.This talk wi
【机 构】
：
DepartmentofMathematics,YanchengTeachersUniversityYancheng,Jiangsu224002,P.R.China
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
There are various matrices that can be associated with graphs.Recently,the results about the Q-spectrum of a graph has been studied extensively.This talk will start with an outline of these results.Most of the talk,however,will be dedicated to very recent results.
其他文献
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
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
Let Q(G;x)=det(xI-Q(G))=∑ni=(-1)iφixn-1 be the characteristic polynomial of the signless Laplacian matrix of a graph G of order n.This talk introduces som
This talk is based on partial results from the following two papers:Partition of a graph into two ycles,Submitted.Vertex-disjoint cycles containing specifie
The classical firefighter problem is a deterministic discrete-time model of the spread and defence of fire/rumor/decease,which was introduced by Bert Hartne
The equitable vertex arboricity of a graph G is the minimum integer t so that the set of vertices of G can be equitably partitioned into t subsets,each of w
Given two graphs G1 and G2,the Ramsey number R(G1,G2)is the smallest integer N such that,for any graph G of order N,either G contains G1 as a subgraph,or th