Show simple item record

AuthorBataineh, M.S.A.
AuthorJaradat, M.M.M.
Available date2023-11-09T05:37:20Z
Publication Date2012
Publication NameDiscussiones Mathematicae - Graph Theory
ResourceScopus
ISSN12343099
URIhttp://dx.doi.org/10.7151/dmgt.1601
URIhttp://hdl.handle.net/10576/49093
AbstractFor two positive integers r and s, G(n;r,s) denotes to the class of graphs on n vertices containing no r of s-edge disjoint cycles and f(n;r,s) = max{E(G):G ∈ G(n;r,s)}. In this paper, for integers r ≥ 2 and k ≥ 1, we determine f(n;r,2k+1) and characterize the edge maximal members in G(n;r,2k+1).
Languageen
PublisherUniversity of Zielona Gora
SubjectCycles
Edge disjoint
Extremal graphs
TitleEdge Maximal C2k+1-edge Disjoint Free Graphs
TypeArticle
Pagination271-278
Issue Number2
Volume Number32
dc.accessType Open Access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record