Author:
Balakrishnan R.,Paulraja P.
Abstract
AbstractAn 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.
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics,Statistics and Probability
Reference4 articles.
1. Graph Theory with Applications
2. Graphs whose squares are chordal;Balakrishnan;Indian J. Pure Appl. Math.,1981
3. On chordal graphs;Laskar;Congressus Numerantium,1980
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献