2021
DOI: 10.1142/s1793557122500693
|View full text |Cite
|
Sign up to set email alerts
|

Maximum total irregularity index of some families of graph with maximum degree n − 1

Abstract: The total irregularity index of a graph [Formula: see text] is defined by Abdo et al. [H. Abdo, S. Brandt and D. Dimitrov, The total irregularity of a graph, Discrete Math. Theor. Comput. Sci. 16 (2014) 201–206] as [Formula: see text], where [Formula: see text] denotes the degree of a vertex [Formula: see text]. In 2014, You et al. [L. H. You, J. S. Yang and Z. F. You, The maximal total irregularity of unicyclic graphs, Ars Comb. 114 (2014) 153–160.] characterized the graph having maximum [Formula: see text] v… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…In this paper, the study describes the previously mentioned graphs with another option yet relatively straightforward methodology. Additionally, the review described the graphs having the greatest irregularity esteem among the classes Tn (Tricyclic graphs), TETn (Tetracyclic graphs), PNTn (Pentacyclic graphs), and HEXn (Hexacyclic graphs) [20].…”
Section: Literature Reviewmentioning
confidence: 99%
“…In this paper, the study describes the previously mentioned graphs with another option yet relatively straightforward methodology. Additionally, the review described the graphs having the greatest irregularity esteem among the classes Tn (Tricyclic graphs), TETn (Tetracyclic graphs), PNTn (Pentacyclic graphs), and HEXn (Hexacyclic graphs) [20].…”
Section: Literature Reviewmentioning
confidence: 99%