New transmission irregular chemical graphs

被引：4

作者：

Xu, Kexiang ^{[1
,2
]}

Tian, Jing ^{[1
,2
]}

Klavzar, Sandi ^{[3
,4
,5
]}

机构：

[1] Nanjing Univ Aeronaut & Astronaut, Sch Math, Nanjing 210016, Jiangsu, Peoples R China

[2] MIIT Key Lab Math Modelling & High Performance Com, Nanjing 210016, Jiangsu, Peoples R China

[3] Univ Ljubljana, Fac Math & Phys, Ljubljana, Slovenia

[4] Inst Math Phys & Mech, Ljubljana, Slovenia

[5] Univ Maribor, Fac Nat Sci & Math, Maribor, Slovenia

来源：

DISCRETE APPLIED MATHEMATICS | 2023年 / 340卷

关键词：

Graph distance; Transmission; Transmission irregular graph; Chemical graph; Tree; WIENER COMPLEXITY; INFINITE FAMILY; DISTANCE; INDEX;

D O I：

10.1016/j.dam.2023.07.017

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The transmission of a vertex v of a (chemical) graph G is the sum of distances from v to other vertices in G. If any two vertices of G have different transmissions, then G is a transmission irregular graph. It is shown that for any odd number n & GE; 7 there exists a transmission irregular chemical tree of order n. A construction is provided which generates new transmission irregular (chemical) trees. Two additional families of chemical graphs are characterized by property of transmission irregularity and two sufficient condition provided which guarantee that the transmission irregularity is preserved upon adding a new edge.& COPY; 2023 Elsevier B.V. All rights reserved.

引用

页码：286 / 295

页数：10

共 41 条

[1] On the status sequences of trees [J].