Infinite family of 2-connected transmission irregular graphs

Standard

Infinite family of 2-connected transmission irregular graphs. / Dobrynin, Andrey A.

In: Applied Mathematics and Computation, Vol. 340, 01.01.2019, p. 1-4.

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

Harvard

Dobrynin, AA 2019, 'Infinite family of 2-connected transmission irregular graphs', Applied Mathematics and Computation, vol. 340, pp. 1-4. https://doi.org/10.1016/j.amc.2018.08.042

APA

Dobrynin, A. A. (2019). Infinite family of 2-connected transmission irregular graphs. Applied Mathematics and Computation, 340, 1-4. https://doi.org/10.1016/j.amc.2018.08.042

Vancouver

Dobrynin AA. Infinite family of 2-connected transmission irregular graphs. Applied Mathematics and Computation. 2019 Jan 1;340:1-4. doi: 10.1016/j.amc.2018.08.042

Author

Dobrynin, Andrey A. / Infinite family of 2-connected transmission irregular graphs. In: Applied Mathematics and Computation. 2019 ; Vol. 340. pp. 1-4.

BibTeX

@article{c4983f22181a409eb3b089e084e0d464,

title = "Infinite family of 2-connected transmission irregular graphs",

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.",

keywords = "Transmission irregular graph, Vertex transmission, Wiener complexity, TREES, WIENER INDEX, COMPLEXITY, TOPOLOGICAL INDEXES",

author = "Dobrynin, {Andrey A.}",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier Inc.",

year = "2019",

month = jan,

day = "1",

doi = "10.1016/j.amc.2018.08.042",

language = "English",

volume = "340",

pages = "1--4",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Science Inc.",

}

RIS

TY - JOUR

T1 - Infinite family of 2-connected transmission irregular graphs

AU - Dobrynin, Andrey A.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Transmission irregular graph

KW - Vertex transmission

KW - Wiener complexity

KW - TREES

KW - WIENER INDEX

KW - COMPLEXITY

KW - TOPOLOGICAL INDEXES

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

U2 - 10.1016/j.amc.2018.08.042

DO - 10.1016/j.amc.2018.08.042

M3 - Article

AN - SCOPUS:85052623394

VL - 340

SP - 1

EP - 4

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

SN - 0096-3003

ER -

ID: 18071110