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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1978-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171278000216 |
| id |
doaj-af0a094c94b64fcca433bd439ffc561c |
|---|---|
| record_format |
Article |
| spelling |
doaj-af0a094c94b64fcca433bd439ffc561c2020-11-24T23:23:55ZengHindawi LimitedInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251978-01-011217718510.1155/S0161171278000216Graphs which have pancyclic complementsH. Joseph Straight0Department of Mathematics, SUNY College at Fredonla, Fredonla 14063, New York, USALet 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 be of rank k if q=p−1+k. (For k equal to 0 and 1 these graphs are called trees and unicyclic graphs, respectively.)http://dx.doi.org/10.1155/S0161171278000216graphspancyclic graphsand unicyclic graphs. |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
H. Joseph Straight |
| spellingShingle |
H. Joseph Straight Graphs which have pancyclic complements International Journal of Mathematics and Mathematical Sciences graphs pancyclic graphs and unicyclic graphs. |
| author_facet |
H. Joseph Straight |
| author_sort |
H. Joseph Straight |
| title |
Graphs which have pancyclic complements |
| title_short |
Graphs which have pancyclic complements |
| title_full |
Graphs which have pancyclic complements |
| title_fullStr |
Graphs which have pancyclic complements |
| title_full_unstemmed |
Graphs which have pancyclic complements |
| title_sort |
graphs which have pancyclic complements |
| publisher |
Hindawi Limited |
| series |
International Journal of Mathematics and Mathematical Sciences |
| issn |
0161-1712 1687-0425 |
| publishDate |
1978-01-01 |
| description |
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 be of rank k if q=p−1+k. (For k equal to 0 and 1 these graphs are called trees and unicyclic graphs, respectively.) |
| topic |
graphs pancyclic graphs and unicyclic graphs. |
| url |
http://dx.doi.org/10.1155/S0161171278000216 |
| work_keys_str_mv |
AT hjosephstraight graphswhichhavepancycliccomplements |
| _version_ |
1725562775110942720 |