Total vertex irregularity strength of trees with maximum degree five

被引：5
|
作者：
Susilawati [1 ]
Baskoro, Edy Tri [1 ]
Simanjuntak, Rinovia [1 ]
机构：
[1] Inst Teknol Bandung, Fac Math & Nat Sci, Combinatorial Math Res Grp, Jalan Ganesa 10, Bandung, Indonesia
来源：
ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS | 2018年 / 6卷 / 02期
关键词：
irregularity strength; total vertex irregularity strength; tree;
D O I：
10.5614/ejgta.2018.6.2.5
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In 2010, Nurdin, Baskoro, Salman and Gaos conjectured that the total vertex irregularity strength of any tree T is determined only by the number of vertices of degrees 1, 2 and 3 in T. This paper will confirm this conjecture by considering all trees with maximum degree five. Furthermore, we also characterize all such trees having the total vertex irregularity strength either t(1), t(2) or t(3), where t(i) = inverted right perpendicular(1 + Sigma(i)(j=1) n(j))/(i + 1)inverted left perpendicular and n(i) is the number of vertices of degree i.
引用
收藏
页码：250 / 257
页数：8
相关论文
共 50 条
  • [41] On the total vertex irregularity strength of comb product of cycle and path with order 3
    Ramdani, R.
    Ramdhani, M. A.
    Delilah, G. G. A.
    4TH ANNUAL APPLIED SCIENCE AND ENGINEERING CONFERENCE, 2019, 2019, 1402
  • [42] Total Vertex Irregularity Strength of 1-Fault Tolerant Hamiltonian Graphs
    Rajasingh, Indra
    Annamma, V.
    MATHEMATICS IN COMPUTER SCIENCE, 2015, 9 (02) : 151 - 160
  • [43] On total irregularity strength of caterpillar graphs with two leaves on each internal vertex
    Rosyida, I.
    Widodo
    Indriati, D.
    1ST INTERNATIONAL CONFERENCE OF COMBINATORICS, GRAPH THEORY, AND NETWORK TOPOLOGY, 2018, 1008
  • [44] Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
    Lu, You
    Li, Jiaao
    Luo, Rong
    Miao, Zhengke
    DISCRETE MATHEMATICS, 2017, 340 (02) : 119 - 123
  • [45] COMPUTING THE TOTAL VERTEX IRREGULARITY STRENGTH ASSOCIATED WITH ZERO DIVISOR GRAPH OF COMMUTATIVE RING
    Ahmad, Ali
    KRAGUJEVAC JOURNAL OF MATHEMATICS, 2022, 46 (05): : 711 - 719
  • [46] VERTEX ARBORICITY AND MAXIMUM DEGREE
    CATLIN, PA
    LAI, HJ
    DISCRETE MATHEMATICS, 1995, 141 (1-3) : 37 - 46
  • [47] On total vertex irregularity strength of generalized uniform cactus chain graphs with pendant vertices
    Rosyida, Isnaini
    Mulyono
    Indriati, Diari
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2020, 23 (06): : 1369 - 1380
  • [48] The total vertex irregularity strength of generalized helm graphs and prisms with outer pendant edges
    Indriati, Diari
    Widodo
    Wijayanti, Indah E.
    Sugeng, Kiki A.
    Baca, Martin
    Semanicova-Fenovcikova, Andrea
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2016, 65 : 14 - 26
  • [49] Total vertex irregularity strength of certain equitable complete m-partite graphs
    Guo, Jing
    Chen, Xiang'en
    Wang, Zhiwen
    Yao, Bing
    ARS COMBINATORIA, 2015, 123 : 407 - 418
  • [50] Extremal trees with fixed degree sequence for σ-irregularity
    Dimitrov, Darko
    Gao, Wei
    Lin, Wenshui
    Chen, Jinsong
    DISCRETE MATHEMATICS LETTERS, 2023, 12 : 166 - 172
12345