Email this article On 2-Connected Transmission Irregular Graphs
- Authors: Dobrynin A.A.1
-
Affiliations:
- Sobolev Institute of Mathematics
- Issue: Vol 12, No 4 (2018)
- Pages: 642-647
- Section: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213111
- DOI: https://doi.org/10.1134/S199047891804004X
- ID: 213111
Cite item
Open Access
Access granted
Subscription Access
Abstract
The transmission of a vertex v in a graph is the sum of the distances from v to all other vertices of the graph. In a transmission irregular graph, the transmissions of all vertices are pairwise distinct. It is known that almost all graphs are not transmission irregular. Some infinite family of transmission irregular trees was constructed by Alizadeh and Klavžar [Appl.Math. Comput. 328, 113–118 (2018)] and the following problemwas formulated: Is there an infinite family of 2-connected graphs with the property? In this article, we construct an infinite family of 2-connected transmission irregular graphs.
About the authors
A. A. Dobrynin
Sobolev Institute of Mathematics
Author for correspondence.
Email: dobr@math.nsc.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090
