Almost self-centered graphs

DOI10.1007/s10114-011-9628-3zbMath1260.05052OpenAlexW2033075862MaRDI QIDQ1942181

Sandi Klavžar, H. B. Walikar, Kishori P. Narayankar

Publication date: 18 March 2013

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-011-9628-3

zbMATH Keywords

diameterradiusself-centered graphalmost self-centered graph

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (18)

Embeddings into almost self-centered graphs of given radius ⋮ On a novel eccentricity-based invariant of a graph ⋮ On two eccentricity-based topological indices of graphs ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ Unnamed Item ⋮ A characterization for 2-self-centered graphs ⋮ Almost self-centered graphs ⋮ Some extremal results on the connective eccentricity index of graphs ⋮ Unnamed Item ⋮ Almost-peripheral graphs ⋮ Constructing almost peripheral and almost self-centered graphs revisited ⋮ Comparison between the non-self-centrality number and the total irregularity of graphs ⋮ Constructing uniform central graphs and embedding into them ⋮ Comparison and extremal results on three eccentricity-based invariants of graphs ⋮ On almost self-centered graphs and almost peripheral graphs ⋮ Relations between total irregularity and non-self-centrality of graphs ⋮ Simplified constructions of almost peripheral graphs and improved embeddings into them ⋮ On the average of the eccentricities of a graph

Cites Work

• Characterization of eccentric digraphs
• Classification of regular planar graphs with diameter two
• Center location problems on tree graphs with subtree-shaped customers
• Graphs isomorphic to their maximum matching graphs
• Locally geodesic cycles in 2-self-centered graphs
• A self-stabilizing algorithm which finds a 2-center of a tree
• Almost self-centered graphs
• Eccentric graphs
• The backup 2‐center and backup 2‐median problems on trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Almost self-centered graphs