Symmetric bipartite graphs and graphs with loops
Discrete Mathematics & Theoretical Computer Science2015Vol. Vol. 17 no. 1(Graph Theory)
Citations Over TimeTop 22% of 2015 papers
Abstract
Graph Theory We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges its two parts. To prove this, we study the relationship between symmetric bipartite graphs and graphs with loops.
Related Papers
- → Infinite homogeneous bipartite graphs with unequal sides(1996)25 cited
- → Classification of Cubic Symmetric Tricirculants(2012)17 cited
- → 2-Factors of cubic bipartite graphs(2021)2 cited
- THE GIRTH OF A 6-HOMOGENEOUS BIPARTITE GRAPH(2006)