On Transmission Irregular Cubic Graphs of an Arbitrary Order
Anatoly Yu. Bezhaev and
Andrey A. Dobrynin
Additional contact information
Anatoly Yu. Bezhaev: Institute of Computational Mathematics and Mathematical Geophysics, The Siberian Branch of the Russian Academy of Sciences, 630090 Novosibirsk, Russia
Andrey A. Dobrynin: Sobolev Institute of Mathematics, The Siberian Branch of the Russian Academy of Sciences, 630090 Novosibirsk, Russia
Mathematics, 2022, vol. 10, issue 15, 1-15
Abstract:
The transmission of a vertex v of a graph G is the sum of distances from v to all the other vertices of G . A transmission irregular graph (TI graph) has mutually distinct vertex transmissions. In 2018, Alizadeh and Klavžar posed the following question: do there exist infinite families of regular TI graphs? An infinite family of TI cubic graphs of order 118 + 72 k , k ≥ 0 , was constructed by Dobrynin in 2019. In this paper, we study the problem of finding TI cubic graphs for an arbitrary number of vertices. It is shown that there exists a TI cubic graph of an arbitrary even order n ≥ 22 . Almost all constructed graphs are contained in twelve infinite families.
Keywords: cubic graph; graph invariant; vertex transmission; transmission irregular graph; Wiener complexity (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/10/15/2741/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/15/2741/ (text/html)
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:gam:jmathe:v:10:y:2022:i:15:p:2741-:d:879091
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().