Stepwise transmission irregular graphs

Andrey A. Dobrynin and Reza Sharafdini

Applied Mathematics and Computation, 2020, vol. 371, issue C

Abstract: The distance d(u, v) between vertices u and v of a connected graph G is defined as the number of edges in a shortest path connecting them. The transmission of a vertex v of G is the sum of distances from v to all the other vertices of G. A graph is stepwise transmission irregular (STI) if the transmissions of any two of its adjacent vertices differ by exactly one. Some basic properties of STI graphs are established and infinite families are constructed.

Keywords: Graph distance; Topological index; Transmission (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319309415
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:371:y:2020:i:c:s0096300319309415

DOI: 10.1016/j.amc.2019.124949

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().