Identifying graph automorphisms using determining sets

zbMATH Open1111.05043MaRDI QIDQ869991FDOQ869991

Authors: Debra L. Boutin 

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127269

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Graphs of order \(n\) with determining number \(n-3\)
• The determining number of Kneser graphs
• Using determining sets to distinguish Kneser graphs
• Determining Number of Kneser Graphs: Exact Values and Improved Bounds
• The determining number of a Cartesian product

zbMATH Keywords

determining numberKneser graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cited In (44)

• Base size sets and determining sets
• Fixing numbers for matroids
• On the distinguishing number of functigraphs
• Automatic proof of graph nonisomorphism
• Edge-locating coloring of graphs
• The full automorphism groups, determining sets and resolving sets of coprime graphs
• On maximal det-independent (res-independent) sets in graphs
• Determining Number of Kneser Graphs: Exact Values and Improved Bounds
• On the fixing number of functigraphs
• Determining number of some families of cubic graphs
• Determining sets, resolving sets, and the exchange property
• The determining number of Kneser graphs
• The difference between the metric dimension and the determining number of a graph
• Destroying automorphisms by fixing nodes
• Planarity and fixing number of inclusion graph of a nilpotent group
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
• On the fixing sets of dihedral groups
• The base size of the symmetric group acting on subsets
• Computing graph automorphism from partial solutions
• Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups
• Automorphism group and other properties of zero component graph over a vector space
• The cost number and the determining number of a graph
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
• Some properties of alternating group networks
• On some properties of vector space based graphs
• Edge-determining sets and determining index
• Automorphism group and fixing number of the orthogonality graph based on rank one upper triangular matrices
• Determining Sets and Determining Numbers of Finite Groups
• Symmetry breaking in tournaments
• The determining number of a Cartesian product
• The isometry group of phylogenetic tree space is $S_n$
• Infinite graphs with finite 2-distinguishing cost
• On some parameters related to fixing sets in graphs
• On automorphisms and fixing number of co-normal product of graphs
• Levenshtein graphs: resolvability, automorphisms \& determining sets
• Symmetry parameters for Mycielskian graphs
• Identifying codes on directed de Bruijn graphs
• Using determining sets to distinguish Kneser graphs
• A formula for the base size of the symmetric group in its action on subsets
• Automorphisms and distinguishing numbers of geometric cliques
• Distinguishing orthogonality graphs
• 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: Identifying graph automorphisms using determining sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869991)