A good characterization of squares of strongly chordal split graphs

被引：16
|
作者：
Van Bang Le [1 ]
Ngoc Tuy Nguyen [2 ]
机构：
[1] Univ Rostock, Inst Informat, D-18051 Rostock, Germany
[2] Hong Duc Univ, Fac Informat Technol, Thanh Hoa, Vietnam
来源：
INFORMATION PROCESSING LETTERS | 2011年 / 111卷 / 03期
关键词：
Graph powers; Squares of split graphs; Good characterizations; Graph algorithms; POWERS;
D O I：
10.1016/j.ipl.2010.11.003
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The square H(2) of a graph H is obtained from H by adding new edges between every two vertices having distance two in H. Lau and Cornell [Recognizing powers of proper interval, split and chordal graphs, SIAM J. Discrete Math. 18 (2004) 83-102] proved that recognizing squares of split graphs is an NP-complete problem. In contrast, we show that squares of strongly chordal split graphs can be recognized in quadratic-time by giving a structural characterization of these graph class. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：120 / 123
页数：4
相关论文
共 50 条
12345