Home
|
About Journal
|
Guide
|
Editorial Board
|
Download
|
Contact
|
Chinese
On the Strong Perfectness of Total Graph
Received:December 05, 1991
Key Words
:
graph
total graph
perfect.
Fund Project
:
Author Name
Affiliation
Zhang Zhongfu
Lanzhou Railway Institute
Lu Xinzhong
Lanzhou Railway Institute
WangZiguo
Northwest Industry University
Shen Xuejun
Hainan Huaxin Group Co.Ltd.
Hits
:
2113
Download times
:
1005
Abstract
:
This paper proves that the total graph T(G)is perfect if and only if each block of Ghas at most three vertices,and the strong perfect conjecture is true for any total graph.
Citation:
DOI
:
10.3770/j.issn:1000-341X.1994.04.033
View Full Text
View/Add Comment
Copyright © Journal of Mathematical Research with Applications
Sponsored by:Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address:No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code :116024
Service Tel:86-411-84707392 Email:jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.