关于图的邻接偏心距和指标
On the Adjacent Eccentric Distance Sum Index of Graphs.
作者信息
Qu Hui, Cao Shujuan
机构信息
Department of Mathematics, Shandong Institute of Business and Technology, Yantai, Shandong, China.
School of Mathematical Sciences, Nankai University, Tianjin, China.
出版信息
PLoS One. 2015 Jun 19;10(6):e0129497. doi: 10.1371/journal.pone.0129497. eCollection 2015.
For a given graph G, ε(v) and deg(v) denote the eccentricity and the degree of the vertex v in G, respectively. The adjacent eccentric distance sum index of a graph G is defined as [Formula in text], where [Formula in text] is the sum of all distances from the vertex v. In this paper we derive some bounds for the adjacent eccentric distance sum index in terms of some graph parameters, such as independence number, covering number, vertex connectivity, chromatic number, diameter and some other graph topological indices.
对于给定的图(G)，(\varepsilon(v))和(\deg(v))分别表示图(G)中顶点(v)的离心率和度。图(G)的邻接离心距离和指标定义为([公式在文本中])，其中([公式在文本中])是顶点(v)到所有其他顶点距离之和。在本文中，我们根据一些图参数，如独立数、覆盖数、顶点连通度、色数、直径以及其他一些图拓扑指标，推导出了邻接离心距离和指标的一些界。
Zotero 插件