• Title/Summary/Keyword: Extermal graphs

Search Result 1, Processing Time 0.015 seconds

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

  • Jaradat, Mohammed M.M.;Bataineh, Mohammed S.A.
    • Kyungpook Mathematical Journal
    • /
    • v.54 no.1
    • /
    • pp.23-30
    • /
    • 2014
  • 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{\geq}2$, we determine f(n; r; ${\theta}_{2k+1}$) and characterize the edge maximal members in G(n; r; ${\theta}_{2k+1}$).