arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.5397math.COcs.DM
收藏

k-弦图的Dirac型刻画

A Dirac-type Characterization of k-chordal Graphs

R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan

摘要:

基于“单纯路径”存在性的k-弦图的特征在[Chv{á}tal et al. Note:Dirac-type characterizations of graphs without long chordless cycles.离散数学,256,445-448,2002]。本文给出了k-弦图的一个刻划,它是[G. A.狄拉克关于刚性电路图。啊数学。萨姆。Univ. Hamburg,25,71-76,1961],其使用“单纯顶点”和“单纯排序”的概念。

英文摘要:

Characterization of k-chordal graphs based on the existence of a "simplicial path" was shown in [Chv{á}tal et al. Note: Dirac-type characterizations of graphs without long chordless cycles. Discrete Mathematics, 256, 445-448, 2002]. We give a characterization of k-chordal graphs which is a generalization of the known characterization of chordal graphs due to [G. A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25, 71-76, 1961] that use notions of a "simplicial vertex" and a "simplicial ordering".

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑