Maximum total irregularity index of some families of graph with maximum degree n − 1
From MaRDI portal
Publication:5865968
DOI10.1142/S1793557122500693zbMath1487.05069MaRDI QIDQ5865968
Shamaila Yousaf, Akhlaq Ahmad Bhatti
Publication date: 10 June 2022
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
total irregularity index\( \mathrm{HEX}_n\) (hexacyclic graphs)\( \mathrm{PNT}_n\) (pentacyclic graphs)\( \mathrm{TET}_n\) (tetracyclic graphs)\( B_n\) (bicyclic graphs)\( T_n\) (tricyclic graphs)\( U_n\) (unicyclic graphs)
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordering of \(c\)-cyclic graphs with respect to total irregularity
- On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees
- The maximal total irregularity of bicyclic graphs
- Comparing the irregularity and the total irregularity of graphs
- The minimal total irregularity of some classes of graphs
- The total irregularity of a graph
- Two irregularity measures possessing high discriminatory ability
This page was built for publication: Maximum total irregularity index of some families of graph with maximum degree n − 1