On strictly Chordality-k graphs

2016/06/01 by Dhanalakshmi, S., Sadagopan, N. · 1 citation
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1606.00359

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 ≥ 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 ≥ 5 graphs.

Cited by

• Short Cycles Decide P-versus-NPC Status ofHamiltonicity on Bisplit Graphs

Related

• Characterization by forbidden induced subgraphs of some subclasses of chordal graphs
• Constrained Hitting Set and Steiner Tree in SC_k and 2K₂-free Graphs
• On P₅-free Chordal bipartite graphs
• On chordality of the power graph of finite groups
• Graphs of bounded chordality