English

Spectral Conditions for the Bipancyclic Bipartite Graphs

Combinatorics 2021-06-28 v1

Abstract

Let G=(X,Y;E)G = (X, Y; E) be a bipartite graph with two vertex partition subsets XX and YY. GG is said to be balanced if X=Y|X| = |Y|. GG is said to be bipancyclic if it contains cycles of every even length from 44 to V(G)|V(G)|. In this note, we present spectral conditions for the bipancyclic bipartite graphs.

Keywords

Cite

@article{arxiv.2106.13741,
  title  = {Spectral Conditions for the Bipancyclic Bipartite Graphs},
  author = {Rao Li},
  journal= {arXiv preprint arXiv:2106.13741},
  year   = {2021}
}