论文信息 - Ordering Unicyclic Graphs with Large Average Eccentricities

Ordering Unicyclic Graphs with Large Average Eccentricities

The eccentricity of a vertex u in a connected graph G is the maximum distance from u to other vertices of G. The n-vertex unicyclic graphs with the i-th largest average eccentricity are determined for all i up to ⌊ n 2 ⌋ 1 with n � 6.

Yunfang Tang | Bo Zhou

[1] Yunfang Tang,et al. On Average Eccentricity , 2012 .

[2] Elena V. Konstantinova,et al. Molecular Hypergraphs: The New Representation of Nonclassical Molecular Structures with Polycentric Delocalized Bonds , 1995, J. Chem. Inf. Comput. Sci..

[3] Frank Harary,et al. Distance in graphs , 1990 .

[4] P. Dankelmann,et al. The Average Eccentricity of a Graph and its Subgraphs , 2022 .