The 2-switch-degree of a graph
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911494842613760 |
|---|---|
| author | Schvöllner, Victor N. Pastine, Adrián |
| author_facet | Schvöllner, Victor N. Pastine, Adrián |
| contents | In this work, we delve into the study of the 2-switch-degree of a graph $G$, which is nothing more than the degree of $G$ as a vertex of the realization graph $\mathcal{G}(d)$ associated with the degree sequence $d$ of $G$. We explore the characteristics of active and inactive vertices, the basic properties of the degree, explicit formulas for its computation, and its behavior in specific families of graphs, such as trees and unicyclic graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_23327 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The 2-switch-degree of a graph Schvöllner, Victor N. Pastine, Adrián Combinatorics In this work, we delve into the study of the 2-switch-degree of a graph $G$, which is nothing more than the degree of $G$ as a vertex of the realization graph $\mathcal{G}(d)$ associated with the degree sequence $d$ of $G$. We explore the characteristics of active and inactive vertices, the basic properties of the degree, explicit formulas for its computation, and its behavior in specific families of graphs, such as trees and unicyclic graphs. |
| title | The 2-switch-degree of a graph |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2511.23327 |