Destroying automorphisms by fixing nodes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2149407
- scientific article; zbMATH DE number 3853103
- Spanning trees fixed by automorphisms of a graph
- Automorphism groups of a graph and a vertex-deleted subgraph
- Automorphisms of the graph of free splittings
- Fixed Points of Automorphisms of Graphs with 1 - Factorizations
- Automorphic decompositions of graphs
- Automorphisms of decompositions
- A note on breaking small automorphisms in graphs
- Identifying graph automorphisms using determining sets
Cites work
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 1749658 (Why is no real title available?)
- scientific article; zbMATH DE number 1439496 (Why is no real title available?)
- A new branch of enumerative graph theory
- A note on the asymptotic and computational complexity of graph distinguishability
- Influence of molecular orientation on X-ray and optical scattering by liquids
- Landmarks in graphs
- Line-critical point determining and point distinguishing graphs
- Locating vertices of trees
- Methods of destroying the symmetries of a graph
- Parallel concepts in graph theory
- Point determination in graphs
- Resolvability in graphs and the metric dimension of a graph
- Symmetry breaking in graphs
Cited in
(35)- The automorphism group and fixing number of the orthogonality graph of the full matrix ring
- Fixing number and metric dimension of a zero-divisor graph associated with a ring
- Extending precolorings to distinguish group actions
- Base size sets and determining sets
- Fixing numbers for matroids
- The full automorphism groups, determining sets and resolving sets of coprime graphs
- Edge-locating coloring of graphs
- Automorphism group and fixing number of (3,6)- and (4,6)-fullerene graphs
- Determining Number of Kneser Graphs: Exact Values and Improved Bounds
- Determining sets, resolving sets, and the exchange property
- On the comparison of the distinguishing coloring and the locating coloring of graphs
- On the fixing number of functigraphs
- The difference between the metric dimension and the determining number of a graph
- Determining number of some families of cubic graphs
- Planarity and fixing number of inclusion graph of a nilpotent group
- On the fixing sets of dihedral groups
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
- On fixing sets of composition and corona product of graphs
- Automorphism related parameters of a graph assoclated to a finite vector space
- The automorphism group and fixing number of orthogonality graph over a vector space
- Automorphism group and other properties of zero component graph over a vector space
- Fixing numbers of graphs and groups
- Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups
- On the fixed number of graphs
- Some properties of alternating group networks
- Automorphism group and fixing number of the orthogonality graph based on rank one upper triangular matrices
- Edge-determining sets and determining index
- Symmetry breaking in tournaments
- Extremal problems on detectable colorings of trees
- The determining number of a Cartesian product
- On some parameters related to fixing sets in graphs
- Levenshtein graphs: resolvability, automorphisms \& determining sets
- On automorphisms and fixing number of co-normal product of graphs
- On the fixatic number of graphs.
- Graphs of order \(n\) with determining number \(n-3\)
This page was built for publication: Destroying automorphisms by fixing nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856873)
