Comparison between the non-self-centrality number and the total irregularity of graphs

DOI10.1016/j.amc.2019.05.054zbMath1428.05089OpenAlexW2949450546WikidataQ127773572 ScholiaQ127773572MaRDI QIDQ2279606

Hanyuan Deng, Hechao Liu, Zikai Tang, Huimin Luo

Publication date: 13 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.05.054

zbMATH Keywords

degreeeccentricitytotal irregularitynon-self-centrality number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (1)

On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees

Cites Work

• Unnamed Item
• Eccentric sequences in graphs
• Almost self-centered median and chordal graphs
• Almost self-centered graphs
• Relations between total irregularity and non-self-centrality of graphs
• On a novel eccentricity-based invariant of a graph
• Comparing the irregularity and the total irregularity of graphs
• The total irregularity of a graph
• NONREGULAR GRAPHS WITH MINIMAL TOTAL IRREGULARITY

This page was built for publication: Comparison between the non-self-centrality number and the total irregularity of graphs