Graphs which have pancyclic complements
Let p and q denote the number of vertices and edges of a graph G, respectively. Let Δ(G) denote the maximum degree of G, and G¯ the complement of G. A graph G of order p is said to be pancyclic if G contains a cycle of each length n, 3≤n≤p. For a nonnegative integer k, a connected graph G is said to...
Na minha lista:
| 主要作者: | |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Wiley
1978-01-01
|
| 叢編: | International Journal of Mathematics and Mathematical Sciences |
| 主題: | |
| 在線閱讀: | http://dx.doi.org/10.1155/S0161171278000216 |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|