Destroying automorphisms by fixing nodes
From MaRDI portal
Publication:856873
DOI10.1016/J.DISC.2006.06.004zbMATH Open1109.05050OpenAlexW2078462949MaRDI QIDQ856873FDOQ856873
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
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
- Resolvability in graphs and the metric dimension of a graph
- Symmetry breaking in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel concepts in graph theory
- Methods of destroying the symmetries of a graph
- Landmarks in graphs
- A note on the asymptotic and computational complexity of graph distinguishability
- Point determination in graphs
- Title not available (Why is that?)
- Influence of molecular orientation on X-ray and optical scattering by liquids
- Title not available (Why is that?)
- Line-critical point determining and point distinguishing graphs
- Locating vertices of trees
- A new branch of enumerative graph theory
Cited In (31)
- Fixing number and metric dimension of a zero-divisor graph associated with a ring
- Determining Number of Some Families of Cubic Graphs
- Extending precolorings to distinguish group actions
- Base size sets and determining sets
- Fixing numbers for matroids
- Edge-locating coloring of graphs
- The full automorphism groups, determining sets and resolving sets of coprime graphs
- Automorphism group and fixing number of \((3,6)\)- and \((4,6)\)-fullerene graphs
- Determining Number of Kneser Graphs: Exact Values and Improved Bounds
- On the comparison of the distinguishing coloring and the locating coloring of graphs
- On the fixing number of functigraphs
- Determining sets, resolving sets, and the exchange property
- The difference between the metric dimension and the determining number of a graph
- Planarity and fixing number of inclusion graph of a nilpotent group
- Title not available (Why is that?)
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
- On the fixing sets of dihedral groups
- The automorphism group and fixing number of orthogonality graph over a vector space
- Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups
- Automorphism group and other properties of zero component graph over a vector space
- Fixing numbers of graphs and groups
- Some properties of alternating group networks
- Edge-determining sets and determining index
- Automorphism group and fixing number of the orthogonality graph based on rank one upper triangular matrices
- Symmetry breaking in tournaments
- Extremal problems on detectable colorings of trees
- The determining number of a Cartesian product
- On automorphisms and fixing number of co-normal product of graphs
- Levenshtein graphs: resolvability, automorphisms \& determining sets
- Graphs of order \(n\) with determining number \(n-3\)
- The automorphism group and fixing number of the orthogonality graph of the full matrix ring
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)
