Balanced Cayley graphs and balanced planar graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Combinatorics, 05E99; 05C99

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/132776

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0707.0155
 http://arxiv.org/abs/0707.0155

Collections

arXiv