Edge Maximal Graphs Containing No Specific Wheels
Keywords:
Extremal graphs; Wheels; Turán problem.Abstract
Let k ≥ 4 be a positive integer. Let G(n;Wk) denote the class of graphs on n vertices containing no wheel Wk as a subgraph. In this paper, we study the following: (1) Edge maximal graphs containing no odd wheels. Furthermore, we characterize the extremal graphs. (2) The edge maximal graph containing no even wheels. (3) The edge maximal graph containing no specific even wheels.
Key words and phrases. Extremal graphs; Wheels; Turán problem.
2000 Mathematics Subject Classification. 05c35 , 05c38
Downloads
Published
2025-05-18
How to Cite
Mohammad Bataineh, M. M. M. Jaradat, & A. M. M. Jaradat. (2025). Edge Maximal Graphs Containing No Specific Wheels. Jordan Journal of Mathematics and Statistics, 8(2), 107–120. Retrieved from https://jjms.yu.edu.jo/index.php/jjms/article/view/1062
Issue
Section
Articles