Sharp Bounds for the Various Spectral Radii of a Graph or a Digraph

来源 :第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The | 被引量 : 0次 | 上传用户：icerjack

【摘要】

：

　　Some sharp bounds of the adjacency spectral radius,the Laplacian spectral radius,the signless Laplacian spectral radius,the distance spectral radius,the dis

【作者】

：

Lihua You

【机构】

：

SchoolofMathematicalSciences,SouthChinaNormalUniversity,Guangzhou510631,P.R.China

【出处】

：

第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The

【发表日期】

：

2015年7期

下载到本地 , 更方便阅读

下载此文赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　Some sharp bounds of the adjacency spectral radius,the Laplacian spectral radius,the signless Laplacian spectral radius,the distance spectral radius,the distance Laplacian spectral radius,the distance signless Laplacian spectral radius of a graph or a digraph were obtained in recent years.

其他文献

On the Existence of Rainbow Cliques in Edge-colored Graphs

　　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

会议

Automorphisms of Cayley Digraph of 2-genetic Groups of Prime-power Order

　　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

会议

Sharp Bounds on Multiplicative Zagreb Indices of k-trees

　　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

会议

Recent Development on Strong Edge Coloring

　　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

会议

Characteristic Polynomials of the Generalized Subdivision-edge Corona

　　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

会议

Per-spectral Characterizations of a Complete Graph and Its Some Edge-deleted Subgraphs

　　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

会议

Resistance Distance and Kirchhoff Index of Graphs

　　In this talk,we give formulas for resistance distances and Kirchhoff indices of some composite graphs,and obtain formulas for the Kirchhoff index,Laplacian-

会议

On a New Cyclicity Measure of Graphs-the Global Cyclicity Index

　　Being motivated in terms of mathematical concepts from the theory of electrical networks,Klein and Ivanciuc introduced and studied a new graph-theoretic cyc

会议

Fault-tolerant Edge-bipancyclicity of Faulty Hypercubes Under the Conditional-fault Model

　　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

会议

The Linear (n-1)-arboricity of Cartesian Product Graphs

　　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(

会议

Sharp Bounds for the Various Spectral Radii of a Graph or a Digraph

其他学术论文