About a conjecture on the centers of chordal graphs

DOI10.1007/BF02986676MaRDI QIDQ1340128zbMATH OpenWikidataFDO

Authors K. S. Parvathy, A. Remadevi, A. Vijayakumar

Publication date 18 April 1995

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02986676

zbMATH Keywords

centerChang conjectureschordal graphdiameter

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38)

Review text

The authors present a chordal graph \(G\) such that the diameter of its center, \(d(C(G))\), is equal to 3. This example disproves the conjecture of G. J. Chang that \(d(C(G)) \leq 2\) for any connected chordal graph with \(d(G) = 2r(G) - 2\); see \textit{G. J. Chang} [Graph Comb. 7, No. 4, 305-313 (1991; Zbl 0763.05053)].

Recommendations

• Centers of chordal graphs
• scientific article; zbMATH DE number 4152427
• scientific article; zbMATH DE number 4114700
• On m-convexity and centers of chordal graphs
• A faster diameter problem algorithm for a chordal graph, with a connection to its center problem

Cites work

• Centers of 2–Trees
• Centers of chordal graphs
• Centers of maximal outerplanar graphs
• Distance center and centroid of a median graph
• scientific article; zbMATH DE number 4152427 (Why is no real title available?)
• scientific article; zbMATH DE number 3937215 (Why is no real title available?)
• On powers and centers of chordal graphs

Cited in

(1)

• On centers of soluble graphs

This page was built for publication: About a conjecture on the centers of chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340128)