본문 바로가기
KERD
논문KCI 등재

Edge-Maximal θ2k+1-Edge Disjoint Free Graphs

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

For two positive integers r and s, g(n;r;θs) denotes to the class of graphs on n vertices containing no r of edgedisjoint θs-graphs and f(n;r;θs) = max{ε(G) : G ∈ g(n;r;θs)}. In this paper, for integers r, k ≥ 2, we determine f(n;r;θ2k+1) and characterize the edgemaximal members in g(n;r;θ2k+1).

Abstract

For two positive integers r and s, g(n;r;θs) denotes to the class of graphs on n vertices containing no r of edgedisjoint θs-graphs and f(n;r;θs) = max{ε(G) : G ∈ g(n;r;θs)}. In this paper, for integers r, k ≥ 2, we determine f(n;r;θ2k+1) and characterize the edgemaximal members in g(n;r;θ2k+1).

참고문헌 (11)

  1. M. Bataineh, "Some Extermal problems in graph theory", Ph.D, pp.2007
  2. M. Bataineh, "Edge Maximal C₂k+₁-edge disjoint free graphs, Dis-cussiones Mathematicae Graph Theory", 32, pp.269~276 (2012)
  3. M. Bataineh, "Edge-maximal graphs without θ5-graphs", Accepted in Ars Combinatoria, ~
  4. J. Bondy, "Large cycle in graphs", Discrete Mathematics, 1, pp.121~132 (1971)
  5. J. Bondy, , J. Combinatorial Theory Ser. B, 11, pp.80~84 (1971)
  6. J. Bondy, "Graph Theory with Applications" (1976), The MacMillan Press
  7. S. Brandt, "A sufficient condition for all short cycles", Discrete Applied Mathematics, 79, pp.63~66 (1997)
  8. L. Caccetta, "A problem in extremal graph theory", ARS Combinatoria, 2, pp.33~56 (1976)
  9. L. Caccetta, "Edge maximal non-bipartite graphs without odd cycles of prescribed length", Graphs and Combinatorics, 18, pp.75~92 (2002)
  10. M. M. Jaradat, "Edge-maximal graphs without θ₂k+₁-graphs", Accepted in AKCE International Journal of Graphs and Combinatorics, ~
  11. R. Jia, "Some Extremal problems in graph theory", Ph.D, pp.1998

관련 논문AI추천

이 간행물의 다른 논문 (13건)