Edge-maximal graphs without θ 7 -graphs
Author | Bataineh, M.S.A. |
Author | Jaradat, M.M.M. |
Author | Al-Shboul, I.Y.A. |
Available date | 2023-11-09T05:37:20Z |
Publication Date | 2011 |
Publication Name | SUT Journal of Mathematics |
Resource | Scopus |
ISSN | 9165746 |
Abstract | Let G(n; θ2k+1, ≥ δ) denote the class of non-bipartite θ2k+1-free graphs on n vertices and minimum degree at least δ and let f (n; θ2k+1, ≥ δ) = max{ε(G): G ∈ G(n; θ2k+1, ≥ δ)}. In this paper we determinj an upker bound of f (n; θ7, ≥ 25) by proving that for large n, f (n; θ7, ≥ 25) ≤⌊(n-2)2/4 ⌊+ 3. Our result confirm the conjecture made in [1], "Some extermal problems in graph theory", Ph.D thesis, Curtin University of Technology, Australia (2007), in case k = 3 and δ=25. AMS 2010 Mathematics Subject Classification. Primary 05C38; Secondary 05C35. |
Language | en |
Publisher | Tokyo University of Science |
Subject | Cycle Extremal graph Theta graph |
Type | Article |
Pagination | 91-103 |
Issue Number | 1 |
Volume Number | 47 |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Materials Science & Technology [299 items ]