Irreducible pseudo 2-factor isomorphic cubic bipartite graphs

Details Irreducible pseudo 2-factor isomorphic cubic bipartite graphs Irreducible pseudo 2-factor isomorphic cubic bipartite graphs

2010-02-09

arxiv.org/abs/1002.1891v1

Mathematics

Combinatorics

Scientific paper

A bipartite graph is {\em pseudo 2--factor isomorphic} if all its 2--factors have the same parity of number of circuits. In \cite{ADJLS} we proved that the only essentially 4--edge-connected pseudo 2--factor isomorphic cubic bipartite graph of girth 4 is $K_{3,3}$, and conjectured \cite[Conjecture 3.6]{ADJLS} that the only essentially 4--edge-connected cubic bipartite graphs are $K_{3,3}$, the Heawood graph and the Pappus graph. There exists a characterization of symmetric configurations $n_3$ %{\bf decide notation and how to use it in the rest of the paper} due to Martinetti (1886) in which all symmetric configurations $n_3$ can be obtained from an infinite set of so called {\em irreducible} configurations \cite{VM}. The list of irreducible configurations has been completed by Boben \cite{B} in terms of their {\em irreducible Levi graphs}. In this paper we characterize irreducible pseudo 2--factor isomorphic cubic bipartite graphs proving that the only pseudo 2--factor isomorphic irreducible Levi graphs are the Heawood and Pappus graphs. Moreover, the obtained characterization allows us to partially prove the above Conjecture.

Affiliated with

Also associated with

No associations

Rating

Irreducible pseudo 2-factor isomorphic cubic bipartite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Irreducible pseudo 2-factor isomorphic cubic bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Irreducible pseudo 2-factor isomorphic cubic bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124896