Symmetric bipartite graphs and graphs with loops - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2015

Symmetric bipartite graphs and graphs with loops

Résumé

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.
Fichier principal
Vignette du fichier
dmtcs-17-1-7.pdf (204.89 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01196863 , version 1 (10-09-2015)

Identifiants

Citer

Grant Cairns, Stacey Mendan. Symmetric bipartite graphs and graphs with loops. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no. 1 (1), pp.97--102. ⟨10.46298/dmtcs.2119⟩. ⟨hal-01196863⟩

Collections

TDS-MACS
66 Consultations
1575 Téléchargements

Altmetric

Partager

More