Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs
An automorphism of a graph is a mapping of the vertices onto themselves such that connections between respective edges are preserved. A vertex <i>v</i> in a graph <i>G</i> is <i>fixed</i> if it is mapped to itself under every automorphism of <i>G</i>....
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-01-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/9/2/166 |