Name
Abstract | ||
|---|---|---|
A graph G on n vertices is called non-universal if its maximum degree is at most n-2. In this paper, we give a structural characterization for non-universal maximal planar graphs with diameter two. In precise, we find 10 basic graphs, and then generate all 25 non-universal maximal planar graphs with diameter two by adding repeatedly and appropriately 3-vertices to some of these 10 basic graphs. As an application, we show that maximal planar graphs with diameter two are pancyclic except five special graphs. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s10878-021-00749-7 | JOURNAL OF COMBINATORIAL OPTIMIZATION |
Keywords | DocType | Volume |
Maximal plane graph, Diameter two, Pancyclicity, Dominating set | Journal | 43 |
Issue | ISSN | Citations |
1 | 1382-6905 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shu-Yu Cui | 1 | 0 | 0.68 |
| Yiqiao Wang | 2 | 494 | 42.81 |
| Danjun Huang | 3 | 0 | 1.01 |
| Hongwei Du | 4 | 0 | 0.34 |
| Weifan Wang | 5 | 868 | 89.92 |