No Detail Found!

Minimum distance-unbalancedness of graphs with diameter 2 and given number of edges

Author(s)
Kexiang Xu College of Science, Nanjing University of Aeronautics & Astronautics,Nanjing, Jiangsu 210016,China ;MIIT Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles,Nanjing 210016,China
Peiqi Yao College of Science, Nanjing University of Aeronautics & Astronautics,Nanjing, Jiangsu 210016,China ;MIIT Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles,Nanjing 210016,China
Abstract
For a graph G, and for two distinct vertices u and v of G, let nG(u; v) be the number of vertices of G that are closer in G to u than to v. The distance-unbalancedness of G is the sum of jnG(u; v) nG(v; u)j over all unordered pairs of distinct vertices u and v of G. We determine the minimum distance-unbalancedness of 2-self-centered graphs with given number of edges. We also determine the minimum distance-unbalancedness of graphs with at least one universal vertex and given number of edges.
Publication Details
Page(s) 26-30
Published Journal: Discrete Mathematics Letters, Volume: 9, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
graph of diameter 2, total irregularity, distance-unbalancedness
0

Citations

0

Downloads

119

Views