[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.4134/BKMS.2015.52.1.287

SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS

Gao, Yunshu (School of Mathematics and Computer Science Ningxia University)
Ma, Ding (School of Mathematics and Computer Science Ningxia University)

Publication Information

Bulletin of the Korean Mathematical Society / v.52, no.1, 2015 , pp. 287-299 More about this Journal

Abstract

A theta graph is the union of three internally disjoint paths that have the same two distinct end vertices. We show that every graph of order $n{\geq}12$ and size at least ${\lfloor}\frac{11n-18}{2}{\rfloor}$ contains three disjoint theta graphs. As a corollary, every graph of order $n{\geq}12$ and size at least ${\lfloor}\frac{11n-18}{2}{\rfloor}$ contains three disjoint cycles of even length.

Keywords

disjoint theta graphs; sufficient condition; minimum degree;

Citations & Related Records

Reference

1	J. A. Bondy and U. S. R. Murty, Graph Theory, the second edition, Springer, 2008.
2	S. Chiba, S. Fujita, Y. Gao, and G. Li, On a sharp degree sum condition for disjoint chorded cycles in graphs, Graphs Combin. 26 (2010), no. 2, 173-186. DOI
3	K. Corradi and A. Hajnal, On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar. 14 (1963), 423-439. DOI
4	G. A. Dirac, On the maximal number of independent triangles, Abh. Math. Sem. Univ. Hamburg 26 (1963), 78-82. DOI
5	H. Enomoto, On the existence of disjoint cycles in a graph, Combinatorica 18 (1998), no. 4, 487-492. DOI
6	D. Finkel, On the number Of independent chorded cycle in a graph, Discrete Math. 308 (2008), no. 22, 5265-5268. DOI ScienceOn
7	Y. Gao and N. Ji, The extremal function for two disjoint cycles, Bull. Malays. Math. Sci. Soc. DOI:10.1007/s40840-014-0102-0,2014. DOI
8	K. Kawarabayashi, $K^-_4$ -factor in graphs, J. Graph Theory 39 (2002), no. 2, 111-128. DOI ScienceOn
9	L. Posa, On the circuits of finite graphs, Magyar Tud. Akad. Mat. Kut. Int. Kozl. 8 (1963), 355-361.
10	H. Wang, On the maximum number of independent cycles in a graph, Discrete Math. 205 (1999), no. 1-3, 183-190. DOI ScienceOn