Name
Abstract | ||
|---|---|---|
A graph is called H-equicoverable if every minimal H-covering of it is also its minimum H-covering. In this paper, we consider how to characterize a graph to be H-equicoverable where H is P-4. We obtained necessary and sufficient conditions for a graph contains a cycle with length greater than 3 but not contains any 3-cycles. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1142/S1793830917500525 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Cycle, covering, equicoverable | Discrete mathematics,Combinatorics,Line graph,Forbidden graph characterization,Cycle graph,Regular graph,Butterfly graph,Mathematics,Pancyclic graph,Voltage graph,Complement graph | Journal |
Volume | Issue | ISSN |
9 | 4 | 1793-8309 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qirui Wang | 1 | 27 | 5.12 |
| tianping shuai | 2 | 6 | 1.09 |
| wenbao ai | 3 | 6 | 1.09 |
| jianhua yuan | 4 | 6 | 1.43 |