Journal of Guangdong University of Technology ›› 2002, Vol. 19 ›› Issue (3): 25-29.

• Comprehensive Studies • Previous Articles     Next Articles

Complexities of Star Partition Number and Its Connections with Domination Number

  

  1. (Faculty of Automation,GDUT,Guangzhou 510090,China)
  • Online:2002-09-04 Published:2002-09-04

HTML

PDF (PC)

2203
[1] 周永生,蔡延光.  树的有效支配集[J]. 甘肃工业大学学报. 1991(01)

[2] 刘松,蔡延光.  树的m—路中心[J]. 重庆大学学报(自然科学版). 1991(04)

[3] 蔡延光,钱积新,孙优贤.  受限p-中心的并行迭代算法[J]. 系统工程理论与实践. 2000(07)

[4] 蔡延光.  图的增广支配数[J]. 湖北汽车工业学院学报. 1999(01)

[5] 蔡延光,石庆忠.  树的受限P—中心[J]. 湖北汽车工业学院学报. 1992(02)

[1] Stockmeyer L J.Planar 3-colorability is NP-complete. SIGACT News . 1973

[2] Acharya B D,Walikar H B.On graphs having unique minimum dominating sets. Graph Theory Newsletter . 1979

[3] Yannkakis M,Gavril F.Edge dominating sets in graphsSIAM J. Journal of Applied Mathematics . 1980

[4] Bondy J A,Murty U S R.Graph Theory with Applications. . 1976
No related articles found!
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright © 2017 Journal of Guangdong University of Technology
Add：729 East Dongfeng RD., Guangzhou PRC. Postcode: 510090
Tel：020-37626653,020-37626139,020-37626396
Email：xbzrb@gdut.edu.cn
Supported:Beijing Magtech