Show simple item record

AuthorJaradat, M. M.M.
AuthorBataineh, M. S.
AuthorAl-Rhayyel, A. A.
AuthorMustafa, Zead
Available date2023-06-07T08:16:38Z
Publication Date2021
Publication NameBoletim da Sociedade Paranaense de Matematica
ResourceScopus
URIhttp://dx.doi.org/10.5269/bspm.41921
URIhttp://hdl.handle.net/10576/44025
AbstractFor a set of graphsF, letH(n;F) denote the class of non-bipartiteHamiltonian graphs onnvertices that does not contain any graph ofFas a subgraphandh(n;F) = max{E(G) :G∈H(n;F)}whereE(G) is the number of edges inG.In this paper we determineh(n;{θ4, θ5, θ7}) andh(n;θ7) for sufficiently odd largen. Our result confirms the conjecture made in [1] fork= 3.
Languageen
PublisherBoletim da Sociedade Paranaense de Matematica
SubjectExtremal graph
Theta graph
Tu ́ran number
TitleExtremal number of theta graphs of order 7
TypeArticle
Pagination21-34
Issue Number4
Volume Number39
dc.accessType Open Access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record