Balanced Cayley graphs and balanced planar graphs
Combinatorics
2007-07-03 v1
Abstract
A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley graphs on abelian groups. Moreover, in Section 5 of this paper, we prove that there is no cubic balanced planar graph. Finally, some remarkable conjectures for balanced regular graphs are also presented.
Keywords
Cite
@article{arxiv.0707.0155,
title = {Balanced Cayley graphs and balanced planar graphs},
author = {Joy Morris and Pablo Spiga and Kerri Webb},
journal= {arXiv preprint arXiv:0707.0155},
year = {2007}
}