Destroying automorphisms by fixing nodes
From MaRDI portal
Publication:856873
DOI10.1016/j.disc.2006.06.004zbMath1109.05050OpenAlexW2078462949MaRDI QIDQ856873
Publication date: 14 December 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.004
Related Items (28)
Automorphism group and fixing number of \((3,6)\)- and \((4,6)\)-fullerene graphs ⋮ On the fixing sets of dihedral groups ⋮ The difference between the metric dimension and the determining number of a graph ⋮ Determining Number of Some Families of Cubic Graphs ⋮ Extending precolorings to distinguish group actions ⋮ Determining Number of Kneser Graphs: Exact Values and Improved Bounds ⋮ On the comparison of the distinguishing coloring and the locating coloring of graphs ⋮ The automorphism group and fixing number of the orthogonality graph of the full matrix ring ⋮ Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups ⋮ Levenshtein graphs: resolvability, automorphisms \& determining sets ⋮ Edge-determining sets and determining index ⋮ Planarity and fixing number of inclusion graph of a nilpotent group ⋮ On the fixing number of functigraphs ⋮ The full automorphism groups, determining sets and resolving sets of coprime graphs ⋮ Automorphism group and fixing number of the orthogonality graph based on rank one upper triangular matrices ⋮ Extremal problems on detectable colorings of trees ⋮ Determining sets, resolving sets, and the exchange property ⋮ Unnamed Item ⋮ Some properties of alternating group networks ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ Automorphism group and other properties of zero component graph over a vector space ⋮ Fixing numbers for matroids ⋮ Fixing number and metric dimension of a zero-divisor graph associated with a ring ⋮ Graphs of order \(n\) with determining number \(n-3\) ⋮ The determining number of a Cartesian product ⋮ Unnamed Item ⋮ Base size sets and determining sets ⋮ The automorphism group and fixing number of orthogonality graph over a vector space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel concepts in graph theory
- A note on the asymptotic and computational complexity of graph distinguishability
- Resolvability in graphs and the metric dimension of a graph
- Line-critical point determining and point distinguishing graphs
- Methods of destroying the symmetries of a graph
- Symmetry breaking in graphs
- Locating vertices of trees
- Point determination in graphs
- Landmarks in graphs
- Influence of molecular orientation on X-ray and optical scattering by liquids
- A new branch of enumerative graph theory
This page was built for publication: Destroying automorphisms by fixing nodes
