2-swappable graphs
Let be a graph, by , we mean the set of all 2-combinations of . We say that a graph is -swappable if for every edge , there are two sets , such that , , and . The swapping number of is the minimum such that is -swappable. Let be an integer. Every tree with exactly one vertex of degree and remaining...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.11.002 |