Show simple item record

AuthorJaradat, M.M.M.
AuthorBataineh, M.S.A.
AuthorAl-Shboul, E.Y.A.
AuthorArumugam, S.
Available date2023-11-09T05:37:20Z
Publication Date2014
Publication NameAKCE International Journal of Graphs and Combinatorics
ResourceScopus
ISSN9728600
URIhttp://dx.doi.org/10.1080/09728600.2014.12088763
URIhttp://hdl.handle.net/10576/49096
AbstractLet σ(n; θ2k+1) denote the class of non-bipartite graphs on n vertices having no θ2k+1- graph and f(n; θ2k+1) = max{ ε(G): G ∊ σ (n; θ2k+1)}. In this paper we determine f(n; θ2k+1), by proving that for k ≥ 4 and n ≥ 36k. Further, the bound is best possible. Our result confirms the conjecture made by Bataineh in his Ph.D. thesis “Some extremal problems in graph theory”, Curtin University of Technology, Australia (2007), for large n.
Languageen
PublisherTaylor and Francis Ltd.
SubjectExtremal graphs
Theta graphs
TitleEdge-Maximal Graphs Without θ2k+1-Graphs
TypeArticle
Pagination57-65
Issue Number1
Volume Number11
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record