Back to Search
Start Over
AN OPTIMAL BINDING NUMBER CONDITION FOR BIPANCYCLISM.
- Source :
-
SIAM Journal on Discrete Mathematics . 2013, Vol. 27 Issue 2, p597-618. 22p. - Publication Year :
- 2013
-
Abstract
- Let G =(V1, V2, E) be a balanced bipartite graph with 2n vertices. The bipartite binding number of G, denoted by B(G), is defined to be n if G = Kn,n and mini∈{1,2} min... |N(S)|/|S| otherwise. We call G bipancyclic if it contains a cycle of every even length m for 4 m 2n. The purpose of this paper is to show that if B(G) > 3/2 and n ≥ 139, then G is bipancyclic; the bound 3/2 is best possible in the sense that there exist infinitely many balanced bipartite graphs G that have B(G)=3/2 but are not Hamiltonian. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 27
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 89041359
- Full Text :
- https://doi.org/10.1137/120886443