Stepwise transmission irregular graphs

Andrey A. Dobrynin; Reza Sharafdini

doi:10.1016/j.amc.2019.124949

Stepwise transmission irregular graphs

Andrey A. Dobrynin, Reza Sharafdini

Лаборатория топологии и динамики ММФ

Результат исследования: Научные публикации в периодических изданиях › статья

Аннотация

The distance d(u, v) between vertices u and v of a connected graph G is defined as the number of edges in a shortest path connecting them. The transmission of a vertex v of G is the sum of distances from v to all the other vertices of G. A graph is stepwise transmission irregular (STI) if the transmissions of any two of its adjacent vertices differ by exactly one. Some basic properties of STI graphs are established and infinite families are constructed.

Язык оригинала	английский
Номер статьи	124949
Число страниц	7
Журнал	Applied Mathematics and Computation
Том	371
DOI	https://doi.org/10.1016/j.amc.2019.124949
Состояние	Опубликовано - 15 апр 2020

Доступ к документу

10.1016/j.amc.2019.124949

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «Stepwise transmission irregular graphs». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

Dobrynin, A. A., & Sharafdini, R. (2020). Stepwise transmission irregular graphs. Applied Mathematics and Computation, 371, [124949]. https://doi.org/10.1016/j.amc.2019.124949

@article{845642d9e2a64a038ea64f8b52e72ed1,

title = "Stepwise transmission irregular graphs",

abstract = "The distance d(u, v) between vertices u and v of a connected graph G is defined as the number of edges in a shortest path connecting them. The transmission of a vertex v of G is the sum of distances from v to all the other vertices of G. A graph is stepwise transmission irregular (STI) if the transmissions of any two of its adjacent vertices differ by exactly one. Some basic properties of STI graphs are established and infinite families are constructed.",

keywords = "Graph distance, Topological index, Transmission, DISTANCE, TREES, WIENER INDEX, COMPLEXITY, INFINITE FAMILY",

author = "Dobrynin, {Andrey A.} and Reza Sharafdini",

year = "2020",

month = apr,

day = "15",

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

language = "English",

volume = "371",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Science Inc.",

}

TY - JOUR

T1 - Stepwise transmission irregular graphs

AU - Dobrynin, Andrey A.

AU - Sharafdini, Reza

PY - 2020/4/15

Y1 - 2020/4/15

N2 - The distance d(u, v) between vertices u and v of a connected graph G is defined as the number of edges in a shortest path connecting them. The transmission of a vertex v of G is the sum of distances from v to all the other vertices of G. A graph is stepwise transmission irregular (STI) if the transmissions of any two of its adjacent vertices differ by exactly one. Some basic properties of STI graphs are established and infinite families are constructed.

AB - The distance d(u, v) between vertices u and v of a connected graph G is defined as the number of edges in a shortest path connecting them. The transmission of a vertex v of G is the sum of distances from v to all the other vertices of G. A graph is stepwise transmission irregular (STI) if the transmissions of any two of its adjacent vertices differ by exactly one. Some basic properties of STI graphs are established and infinite families are constructed.

KW - Graph distance

KW - Topological index

KW - Transmission

KW - DISTANCE

KW - TREES

KW - WIENER INDEX

KW - COMPLEXITY

KW - INFINITE FAMILY

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

U2 - 10.1016/j.amc.2019.124949

DO - 10.1016/j.amc.2019.124949

M3 - Article

AN - SCOPUS:85076611646

VL - 371

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

SN - 0096-3003

M1 - 124949

ER -