Identifying graph automorphisms using determining sets

MaRDI QIDQ869991zbMATH OpenFDO

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, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r78.html

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

zbMATH Keywords

determining numberKneser graphs

Mathematics Subject Classification ID

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

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

Cited in

(44)

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

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)