Edge-Maximal 𝜃 k+1 -Edge Disjoint Free Graphs

• Published in: Kyungpook mathematical journal Vol. 54; no. 1; pp. 23 - 30
• Main Authors: Jaradat, Mohammed M.M, Bataineh, Mohammed S.A
• Format: Journal Article
• Language: Korean
• Published: 2014
• Subjects: Edge-disjoint; Extermal graphs; Theta graph

For two positive integers r and s, $\mathcal{G}$(n; r; ${\theta}_s$) denotes to the class of graphs on n vertices containing no r of edge disjoint ${\theta}_s$-graphs and f(n; r; ${\theta}_s$) = max{${\varepsilon}(G)$ : G ${\in}$ $\mathcal{G}$(n; r; ${\theta}_s$)}. In this paper, for integers r, $k{...