Spectral Conditions for the Bipancyclic Bipartite Graphs
Combinatorics
2021-06-28 v1
Abstract
Let be a bipartite graph with two vertex partition subsets and . is said to be balanced if . is said to be bipancyclic if it contains cycles of every even length from to . In this note, we present spectral conditions for the bipancyclic bipartite graphs.
Cite
@article{arxiv.2106.13741,
title = {Spectral Conditions for the Bipancyclic Bipartite Graphs},
author = {Rao Li},
journal= {arXiv preprint arXiv:2106.13741},
year = {2021}
}