Balanced Cayley graphs and balanced planar graphs

Simple item page
dc.creatorMorris, Joy
dc.creatorSpiga, Pablo
dc.creatorWebb, Kerri
dc.date2007-07-02
dc.date.accessioned2026-07-07T08:13:27Z
dc.date.available2026-07-07T08:13:27Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/0707.0155
dc.identifierhttp://arxiv.org/abs/0707.0155
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132776
dc.subjectCombinatorics
dc.subject05E99; 05C99
dc.titleBalanced Cayley graphs and balanced planar graphs
dc.typetext

Files

Collections

arXiv