About a conjecture on the centers of chordal graphs (Q1340128)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 700943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | About a conjecture on the centers of chordal graphs |
scientific article; zbMATH DE number 700943 |
Statements
About a conjecture on the centers of chordal graphs (English)
0 references
18 April 1995
0 references
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)].
0 references
Chang conjectures
0 references
chordal graph
0 references
diameter
0 references
center
0 references
0.7387561798095703
0 references
0.7019950151443481
0 references
