2-switch transition on unicyclic graphs and pseudoforest
Combinatorics
2021-03-02 v1
Abstract
In the present work we prove that given any two unicycle graphs (pseudoforests) that share the same degree sequence there is a finite sequence of 2-switches transforming one into the other such that all the graphs in the sequence are also unicyclic graphs (pseudoforests).
Keywords
Cite
@article{arxiv.2103.00618,
title = {2-switch transition on unicyclic graphs and pseudoforest},
author = {Daniel A. Jaume and Adrián Pastine and Victor Schvöllner},
journal= {arXiv preprint arXiv:2103.00618},
year = {2021}
}
Comments
12 pages. arXiv admin note: text overlap with arXiv:2004.11164