Cargando…
On the Adjacent Eccentric Distance Sum Index of Graphs
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 [Image: see text] , where [Image: see text] is the sum of all distances from the vertex v. In this paper we derive some...
Autores principales: | Qu, Hui, Cao, Shujuan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4474630/ https://www.ncbi.nlm.nih.gov/pubmed/26091095 http://dx.doi.org/10.1371/journal.pone.0129497 |
Ejemplares similares
-
Chain Hexagonal Cacti with the Extremal Eccentric Distance Sum
por: Qu, Hui, et al.
Publicado: (2014) -
Strong sum distance in fuzzy graphs
por: Tom, Mini, et al.
Publicado: (2015) -
Bounds for the general sum-connectivity index of composite graphs
por: Akhter, Shehnaz, et al.
Publicado: (2017) -
Conjugated tricyclic graphs with maximum variable sum exdeg index
por: Rizwan, Muhammad, et al.
Publicado: (2023) -
On Proper Labellings of Graphs with Minimum Label Sum
por: Bensmail, Julien, et al.
Publicado: (2020)