2. 您的位置
3. 首页
4. 会议论文
5. Some extremal mathematical results on the eccentricity-based topological indices of graphs

Some extremal mathematical results on the eccentricity-based topological indices of graphs

来源 :The 12th Meeting of the International Academy of Mathematica | 被引量 : 0次 | 上传用户：C12sdn

【摘 要】

：

　　The eccentricity εG(v)of a vertex v in a graph G is the maximum distance from v to other vertices in G.As a fundamental concept in pure graph theory,the ec

【作 者】

：

Kexiang Xu 

【机 构】

：

CollegeofScience,NanjingUniversityofAeronautics&AstronauticsNanjing,Jiangsu210016,PRChina

【出 处】

：

The 12th Meeting of the International Academy of Mathematica

【发表日期】

：

2016年7期

下载到本地 , 更方便阅读

下载此文 赞助VIP

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

论文部分内容阅读

　　The eccentricity εG(v)of a vertex v in a graph G is the maximum distance from v to other vertices in G.As a fundamental concept in pure graph theory,the eccentricity has also been frequently used in chemical graph theory.

其他文献

基于TiO2和CdTe荧光共振能量转移的PDT体外灭活HL60细胞实验研究

会议

光网络物理安全技术研究

会议

5-regular oriented graphs with optimum skew energy

　　Let G be a simple undirected graph and Gσ be the corresponding oriented graph of G with the orientation σ.The skew energy of Gσ,denoted by εs(Gσ),is de

会议

On energy,Laplacian energy and signless Laplacian energy of graphs

　　The energy ε(G)of a simple graph G is the sum of absolute values of the eigenvalues of its adjacency matrix.The energy of line graph,the Laplacian energy a

会议

On the posterity of AutoGraphiX conjectures

　　We discuss the posterity of AutoGraphiX conjectures,i.e.,new concepts and new conjectures on chemical indices and proofs thereof since the first paper in th

会议

Pairwise Incompatibility of the Kekule,Fries,and Clar Numbers for Benzenoids

　　We consider three measures of stability for benzenoids(or graphene patches): the number of Kekule structures(K),the Fries number(F),and the Clar number(C).M

会议

Graph energy change due to any single edge deletion

　　The energy of a graph is the sum of the absolute values of its eigenvalues.We propose a new problem on graph energy change due to any single edge deletion.T

会议

A recursion formula for resistance distance and its applications

　　Intrinsic metrics on a graph G have become of interest.Amongst these metrics are the common shortest-path metric,and also the "resistance distance",for whic

会议

The complete forcing numbers of graphs

　　Let G be a graph with edge set E(G)that admits a perfect matching M.A forcing set of M is a subset of M contained in no other perfect matchings of G.A compl

会议

Some results on the total irregularity of graphs

　　In [H.Abdo,S.Brandt,D.Dimitrov,The total irregularity of a graph,Discrete Math.Theor.Comput.Sci.16(2014),201-206],Abdo and Dimitov defined the total irregul

会议