The Average Eccentricity of Block Graphs: A Block Order Sequence Perspective
A graph is a <i>block graph</i> if its blocks are all cliques. In this paper, we study the average eccentricity of block graphs from the perspective of <i>block order sequences</i>. An equivalence relation is established under the block order sequence and used to prove the lo...
Main Authors: | Xingfu Li, Guihai Yu, Kinkar Chandra Das |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-03-01
|
Series: | Axioms |
Subjects: | |
Online Access: | https://www.mdpi.com/2075-1680/11/3/114 |
Similar Items
-
Average Degree-Eccentricity Energy of Graphs
by: Ivan Gutman, et al.
Published: (2018-06-01) -
The eccentricity spread of weak-friendship graphs
by: Xuanshi Jia, et al.
Published: (2023-08-01) -
Ordering graphs with large eccentricity-based topological indices
by: Yunfang Tang, et al.
Published: (2021-01-01) -
Gallai's path decomposition conjecture for block graphs
by: Xiaohong Chen, et al.
Published: (2025-01-01) -
Unsupervised DNF Blocking for Efficient Linking of Knowledge Graphs and Tables
by: Mayank Kejriwal
Published: (2021-03-01)