A new characterization of strongly chordal graphs

被引：5

作者：

McKee, TA ^{[1
]}

机构：

[1] Wright State Univ, Dept Math & Stat, Dayton, OH 45435 USA

来源：

DISCRETE MATHEMATICS | 1999年 / 205卷 / 1-3期

关键词：

D O I：

10.1016/S0012-365X(99)00107-7

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The 'strength' of an edge or cycle is the number of maximal complete subgraphs it is in. Strongly chordal graphs are characterized by every cycle of edges of strengths at least k with no chord of strength at least k always itself having strength at least k. Among hereditary clique-Helly graphs, this is equivalent to the subgraph of edges of strength at least k always forming a chordal graph. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：245 / 247

页数：3