On quartic transmission irregular graphs

Anatoly Yu. Bezhaev and Andrey A. Dobrynin

Applied Mathematics and Computation, 2021, vol. 399, issue C

Abstract: Distance between two vertices is the number of edges in a shortest path connecting them in a connected graph G. The transmission of a vertex v is the sum of distances from v to all the other vertices of G. If transmissions of all vertices are mutually distinct, then G is a transmission irregular graph. The following problem was posed by Alizadeh and Klavžar [Appl Math Comput 328 (2018) 113–118]: do there exist infinite families of regular transmission irregular graphs? In this paper, we construct an infinite family of 4-regular transmission irregular graphs.

Keywords: Graph invariant; Vertex transmission; Transmission irregular graph; Wiener complexity (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321000977
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:399:y:2021:i:c:s0096300321000977

DOI: 10.1016/j.amc.2021.126049

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 ().