Fan Wu, Yuqin Zhang, "P5-Equicoverable Graphs Which Contain Cycles With Length at Least 5," WSEAS Transactions on Mathematics, vol. 16, pp. 113-122, 2017, DOI:
Fan Wu, Yuqin Zhang. P5-Equicoverable Graphs Which Contain Cycles With Length at Least 5.
WSEAS Transactions on Mathematics. 2017;16:113-122.
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 16, 2017
P5-Equicoverable Graphs Which Contain Cycles With Length at Least 5
Authors: ,
Abstract: A graph G is called H-equicoverable if every minimal H-covering of G is also a minimum H-covering of G. In this paper, we investigate the characterization of P5-equicoverable graphs which contain cycles with length at least 5 and give some results of Pk-equicoverable graphs.
Pages: 113-122 WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 16, 2017, Art. #14 DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
×
Citation Tools