| 自余弱弦图 |
| |
| 作者姓名： | MERAJUDDIN PARVEZ Ali KIRMANI S A K K PIRZADA S |
| |
| 作者单位： | 1. 阿里格尔穆斯林大学工程技术学院应用数学系,印度,202002
2. 克什米尔大学数学系,印度斯利那加 |
| |
| 摘 要： | 研究了一类自余(sc)弱弦图,即广义的自余弱弦图,得到了一些自余弱弦图的下边界和上边界.讨论了自余弱弦图的识别问题,特别地给出了一种O(m2)时间算法,能推断自余图是弱弦的还是非弱弦的,进一步作者编目了自余弱弦图的至少17种异体.
|
| 关 键 词： | 自余 弱弦图 双对偶 |
On self-complementary weakly chordal graphs |
| |
| MERAJUDDIN,PARVEZ Ali,KIRMANI S A K K,PIRZADA S.On self-complementary weakly chordal graphs[J].Journal of Zhejiang University(Sciences Edition),2010,37(2):131-136. |
| |
| Authors: | MERAJUDDIN PARVEZ Ali KIRMANI S A K K PIRZADA S |
| |
| Institution: | Department of Applied Mathematics Z.H.College of Engineering Technology,Aligarh Muslim University,202002 India;2.Department of Mathematics,University of Kashmir,Srinagar,India) |
| |
| Abstract: | The class of self-complementary(sc)weakly chordal graphs is studied,which is a generalization of selfcomplementary chordal graphs,lower and upper bounds for the number of two-pairs in se weakly chordal graphs have been obtained.The recognition problem on the self-complementary weakly chordal graphs is discussed. In particular,an O(m~3)time algorithm which determines whether a self-complementary graph is weakly chordal or not is discussed.Moreover,self-complementary weakly chordal graphs with at most 17 vertices is in catalogue. |
| |
| Keywords: | self-complementary weakly chordal graphs two-pairs |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《浙江大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《浙江大学学报(理学版)》下载免费的PDF全文 |
