Open Access
2012 ALMOST SELF-CENTERED MEDIAN AND CHORDAL GRAPHS
Kannan Balakrishnan, Boštjan Brešar, Manoj Changat, Sandi Klavžar, Iztok Peterin, Ajitha R. Subhamathi
Taiwanese J. Math. 16(5): 1911-1922 (2012). DOI: 10.11650/twjm/1500406804

Abstract

Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost self-centered graphs among median graphs and among chordal graphs. In the first case $P_4$ and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is much richer, despite the fact that their diameter is at most 3. We also discuss almost self-centered graphs among partial cubes and among $k$-chordal graphs, classes of graphs that generalize median and chordal graphs, respectively. Characterizations of almost self-centered graphs among these two classes seem elusive.

Citation

Download Citation

Kannan Balakrishnan. Boštjan Brešar. Manoj Changat. Sandi Klavžar. Iztok Peterin. Ajitha R. Subhamathi. "ALMOST SELF-CENTERED MEDIAN AND CHORDAL GRAPHS." Taiwanese J. Math. 16 (5) 1911 - 1922, 2012. https://doi.org/10.11650/twjm/1500406804

Information

Published: 2012
First available in Project Euclid: 18 July 2017

zbMATH: 1252.05048
MathSciNet: MR2970692
Digital Object Identifier: 10.11650/twjm/1500406804

Subjects:
Primary: 05C12 , 05C75 , 90B80

Keywords: almost self-centered graph , chordal graph , diameter , median graph , radius

Rights: Copyright © 2012 The Mathematical Society of the Republic of China

Vol.16 • No. 5 • 2012
Back to Top