Show simple item record

AuthorBataineh, M.S.
AuthorAl-Rhayyel, A.A.
AuthorMustafa, Zead
AuthorJaradat, M.M.M.
Available date2020-08-18T08:34:16Z
Publication Date2019
Publication NameItalian Journal of Pure and Applied Mathematics
ResourceScopus
ISSN11268042
URIhttp://hdl.handle.net/10576/15584
AbstractFor a set of graphs F, let H(n; F) denote the class of non-bipartite Hamiltonian graphs on n vertices that does not contain any graph of F as a subgraph and h(n; F) = max{E(G): G ? H(n; F)} where E(G) is the number of edges in G. In this paper, we determine h(n; {?4, ?5, ?7}) and we establish an upper bound of h(n; ?7) for sufficiently even large n. Our results confirms the conjecture made in [1] for k = 3. - 2019 Forum-Editrice Universitaria Udinese SRL. All rights reserved.
Languageen
PublisherForum-Editrice Universitaria Udinese SRL
SubjectExtremal graph
Theta graph
Tu�ran number
TitleEdge maximal non-bipartite Hamiltonian graphs without theta graphs of order 7
TypeArticle
Pagination413-427
Issue Number42
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