On strictly Chordality-k graphs
Discrete Mathematics
2017-09-04 v2
Abstract
Strictly Chordality-k graphs (SC_k graphs) are graphs which are either cycle free or every induced cycle is exactly k, for some fixed k, k \geq 3. Note that k = 3 and k = 4 are precisely the Chordal graphs and Chordal Bipartite graphs, respectively. In this paper, we initiate a structural and an algorithmic study of SCk, k \geq 5 graphs.
Keywords
Cite
@article{arxiv.1606.00359,
title = {On strictly Chordality-k graphs},
author = {S. Dhanalakshmi and N. Sadagopan},
journal= {arXiv preprint arXiv:1606.00359},
year = {2017}
}
Comments
25 pages, 11 figures, 2 tables, 3 algorithms, In revision in Discrete Applied Mathematics