Browsing by Subject "Extremal graphs"
Now showing items 1-2 of 2
-
Edge Maximal C2k+1-edge Disjoint Free Graphs
( University of Zielona Gora , 2012 , Article)For 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 ... -
Edge-Maximal Graphs Without θ2k+1-Graphs
( Taylor and Francis Ltd. , 2014 , Article)Let σ(n; θ2k+1) denote the class of non-bipartite graphs on n vertices having no θ2k+1- graph and f(n; θ2k+1) = max{ ε(G): G ∊ σ (n; θ2k+1)}. In this paper we determine f(n; θ2k+1), by proving that for k ≥ 4 and n ≥ 36k. ...