Extremal number of theta graphs of order 7
For a set of graphs F , let H(n; F ) denote the class of non-bipartite Hamiltonian graphs on n vertices that does not contain any graph of F as a subgraph and h(n; F ) = max{E (G) : G E H(n; F )} where E (G) is the number of edges in G. In this paper we determine h(n; {84, 85, 87}) and h(n; 87) f...
Main Authors: | Mohammad M. M. Jaradat, M. S. Bataineh, A. A. Al-Rhayyel, Zead Mustafa |
---|---|
Format: | Article |
Language: | English |
Published: |
Sociedade Brasileira de Matemática
2020-10-01
|
Series: | Boletim da Sociedade Paranaense de Matemática |
Online Access: | https://periodicos.uem.br/ojs/index.php/BSocParanMat/article/view/41921 |
Similar Items
-
The ramsey number for theta graph versus a clique of order three and four
by: Bataineh M.S.A., et al.
Published: (2014-05-01) -
A note on the Ramsey numbers for theta graphs versus the wheel of order
by: Mohammed M.M. Jaradat, et al.
Published: (2018-08-01) -
Edge-maximal -free non-bipartite Hamiltonian graphs of odd order
by: M. M. M. Jaradat, et al.
Published: (2022-09-01) -
On the Lovász theta−number of almost regular graphs with application to Erdös−Rényi graphs
by: Klerk, E, et al.
Published: (2009) -
New solitary wave and multiple soliton solutions for fifth order nonlinear evolution equation with time variable coefficients
by: H.M. Jaradat, et al.
Published: (2018-03-01)