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.