Removing Twins in Graphs to Break Symmetries
Determining vertex subsets are known tools to provide information about automorphism groups of graphs and, consequently about symmetries of graphs. In this paper, we provide both lower and upper bounds of the minimum size of such vertex subsets, called the determining number of the graph. These boun...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | info:eu-repo/semantics/article |
| Språk: | English |
| Publicerad: |
MDPI
2020
|
| Ämnen: | |
| Länkar: | http://hdl.handle.net/10835/7486 |