【摘 要】
：
Let G be a graph and λ1≥λ2≥…≥λn the eigenvalues of G.The energy E(G)of G is defined as ∑nk=1|λk|.A well-known result on the energy of graphs is the
【机 构】
：
DepartmentofAppliedMathematics,SchoolofScience,NorthwesternPolytechnicalUniversityXi'an,Shaanxi7100
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
Let G be a graph and λ1≥λ2≥…≥λn the eigenvalues of G.The energy E(G)of G is defined as ∑nk=1|λk|.A well-known result on the energy of graphs is the Coulson integral formula which gives the relationship between the energy and the characteristic polynomial of graphs.
其他文献
In this talk,we shall introduce some results on judicious k-partitions of graphs,which improve the main results of [B,Xu,X.Yu,Better bounds for k-partitions
Clustering algorithms for unsigned networks which have only positive edges have been studied intensively.However,when a network has like/dislike,love/hate,r
A gc-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least g(v)times.The maximum integer k such that G has a g
Anti-Kekulé problem is a concept of chemical graph theory precluding the Kekulé structure of the molecules.Matching preclusion and conditional matching pr
A tree is called double starlike if it has exactly two vertices of degree greater than two.Let H(p,n,q)denote the double starlike tree obtained by attaching
Let G be a graph,B(G),Bc(G),BS(G),BSc(G)and C(G)be the band-width,cyclic bandwidth,bandwidth sum,cyclic bandwidth sum and cutwidth of G,respectively.
An r-acyclic edge coloring of a graph G is a proper edge coloring such that any cycle C has at least min{|C|,r} colors.The least number of colors needed for
The genus distribution of a graph G is defined to be the sequence {gm},where gm is the number of di erent embeddings of G in the closed orientable surface o
Treewidth is a graph parameter of fundamental importance in graph minor theory,with numerous applications in algorithmic theory and practical computing.In t
Corrádi and Hajnal[On the maximal number of independent circuits in a graph,Acta Math.Acad.Sci.Hungar.14(1963),423-439] investigated the maximum number of