Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-23T14:22:34.078Z Has data issue: false hasContentIssue false
  • English
  • Français

Powers of chordal graphs

Part of: Graph theory

Published online by Cambridge University Press:  09 April 2009

R. Balakrishnan  and
P. Paulraja
R. Balakrishnan
Affiliation:
Department of MathematicsNational CollegeTiruchirapalli, 620 001, India
P. Paulraja
Affiliation:
Department of MathematicsNational CollegeTiruchirapalli, 620 001, India
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

An undirected simple graph G is called chordal if every circle of G of length greater than 3 has a chord. For a chordal graph G, we prove the following: (i) If m is an odd positive integer, Gm is chordal. (ii) If m is an even positive integer and if Gm is not chordal, then none of the edges of any chordless cycle of Gm is an edge of Gr, r < m.

MSC classification

Secondary: 05C99: None of the above, but in this section
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 35 , Issue 2 , October 1983 , pp. 211 - 217
Copyright
Copyright © Australian Mathematical Society 1983

References

[1]Balakrishnan, R. and Paulraja, P., ‘Graphs whose squares are chordal,’ Indian J. Pure Appl. Math. 12 (1981), 193–194 with erratum, same J. 12 (1981), 1062.Google Scholar
[2]Bondy, J. A. and Murty, U. S. R., Graph theory with applications (Macmillan 1976).CrossRefGoogle Scholar
[3]Laskar, Renu and Shier, D., ‘On chordal graphs,’ Congressus Numerantium, 29 (1980), 579–588.Google Scholar
[4]Laskar, Renu and Shier, D., On powers and centres of chordal graphs, Technical Report # 357 (Department of Mathematical Sciences, Clemson University, South Carolina, 02 1981).Google Scholar