Article ID Journal Published Year Pages File Type
4649113 Discrete Mathematics 2010 8 Pages PDF
Abstract

A balanced graph is a bipartite graph with no induced circuit of length 2(mod4). These graphs arise in integer 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 this paper, we prove that there is no cubic balanced planar graph. Finally, some remarkable conjectures for balanced regular graphs are also presented. The graphs in this paper are simple.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , ,