Symmetric bipartite graphs and graphs with loops

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 rela...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics and theoretical computer science 2015-01, Vol.17 no. 1 (Graph Theory), p.97-102
Main Authors: Cairns, Grant, Mendan, Stacey
Format: Article
Language:English
Subjects:
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
bipartite graphs
Computer Science
degree sequence
Discrete Mathematics
symmetry
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.2119