Standard

Infinite family of transmission irregular trees of even order. / Dobrynin, Andrey A.

In: Discrete Mathematics, Vol. 342, No. 1, 01.01.2019, p. 74-77.

Research output: Contribution to journal › Article › peer-review

Harvard

Dobrynin, AA 2019, 'Infinite family of transmission irregular trees of even order', Discrete Mathematics, vol. 342, no. 1, pp. 74-77. https://doi.org/10.1016/j.disc.2018.09.015

APA

Dobrynin, A. A. (2019). Infinite family of transmission irregular trees of even order. Discrete Mathematics, 342(1), 74-77. https://doi.org/10.1016/j.disc.2018.09.015

Vancouver

Dobrynin AA. Infinite family of transmission irregular trees of even order. Discrete Mathematics. 2019 Jan 1;342(1):74-77. doi: 10.1016/j.disc.2018.09.015

Author

Dobrynin, Andrey A. / Infinite family of transmission irregular trees of even order. In: Discrete Mathematics. 2019 ; Vol. 342, No. 1. pp. 74-77.

BibTeX

@article{f5b1d6fbca9b4749a130ab6495bbf854,
title = "Infinite family of transmission irregular trees of even order",
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. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees of odd order were presented in Alizadeh and Klavzar (2018). The following problem was posed in Alizadeh and Klavzar (2018): do there exist infinite families of transmission irregular trees of even order? In this article, such a family is constructed. (C) 2018 Elsevier B.V. All rights reserved.",
keywords = "Graph invariant, Transmission irregular graph, Vertex transmission, Wiener complexity, WIENER INDEX, COMPLEXITY",
author = "Dobrynin, {Andrey A.}",
note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",
year = "2019",
month = jan,
day = "1",
doi = "10.1016/j.disc.2018.09.015",
language = "English",
volume = "342",
pages = "74--77",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

RIS

TY - JOUR

T1 - Infinite family of transmission irregular trees of even order

AU - Dobrynin, Andrey A.

N1 - Publisher Copyright: © 2018 Elsevier B.V.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees of odd order were presented in Alizadeh and Klavzar (2018). The following problem was posed in Alizadeh and Klavzar (2018): do there exist infinite families of transmission irregular trees of even order? In this article, such a family is constructed. (C) 2018 Elsevier B.V. All rights reserved.

AB - 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. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees of odd order were presented in Alizadeh and Klavzar (2018). The following problem was posed in Alizadeh and Klavzar (2018): do there exist infinite families of transmission irregular trees of even order? In this article, such a family is constructed. (C) 2018 Elsevier B.V. All rights reserved.

KW - Graph invariant

KW - Transmission irregular graph

KW - Vertex transmission

KW - Wiener complexity

KW - WIENER INDEX

KW - COMPLEXITY

UR - http://www.scopus.com/inward/record.url?scp=85054379094&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2018.09.015

DO - 10.1016/j.disc.2018.09.015

M3 - Article

AN - SCOPUS:85054379094

VL - 342

SP - 74

EP - 77

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -

ID: 18070680