| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8966131 | Applied Mathematics and Computation | 2019 | 4 Pages |
Abstract
Distance between two vertices is the number of edges in the 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. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees were presented in [4]. The following problem was posed in [4]: do there exist infinite families of 2-connected transmission irregular graphs? In this paper, an infinite family of such graphs is constructed.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Andrey A. Dobrynin,