Аннотация
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.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 1-4 |
Число страниц | 4 |
Журнал | Applied Mathematics and Computation |
Том | 340 |
DOI | |
Состояние | Опубликовано - 1 янв 2019 |