Edge-maximal -free non-bipartite Hamiltonian graphs of odd order
| Author | Jaradat, M. M. M. |
| Author | Baniabedalruhman, A. |
| Author | Bataineh, M. S. |
| Author | Jaradat, A. M. M. |
| Author | Al-Rhayyel, A. A. |
| Available date | 2023-11-09T05:37:20Z |
| Publication Date | 2022 |
| Publication Name | AKCE International Journal of Graphs and Combinatorics |
| Resource | Scopus |
| ISSN | 9728600 |
| Abstract | Let (Formula presented.) denote the class of non-bipartite graphs on n vertices containing no (Formula presented.) -graph and (Formula presented.) Let (Formula presented.) denote the class of non-bipartite Hamiltonian graphs on n vertices containing no (Formula presented.) -graph and (Formula presented.) In this paper we determine (Formula presented.) by proving that for sufficiently large odd n, (Formula presented.) Furthermore, the bound is best possible. Our results confirm the conjecture made by Bataineh in 2007. |
| Sponsor | Open Access funding provided by the Qatar National Library. |
| Language | en |
| Publisher | Taylor and Francis Ltd. |
| Subject | 05C35 05C55 complete graph Ramsey number theta graph |
| Type | Article |
| Pagination | 282-286 |
| Issue Number | 3 |
| Volume Number | 19 |
Files in this item
This item appears in the following Collection(s)
-
Materials Science & Technology [310 items ]