Identifying graph automorphisms using determining sets
From MaRDI portal
Publication:869991
zbMath1111.05043MaRDI QIDQ869991
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
Related Items (34)
THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH ⋮ 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 ⋮ Identifying codes on directed de Bruijn graphs ⋮ Determining Number of Kneser Graphs: Exact Values and Improved Bounds ⋮ Distinguishing orthogonality graphs ⋮ On some properties of vector space based graphs ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ 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 ⋮ The isometry group of phylogenetic tree space is $S_n$ ⋮ Unnamed Item ⋮ Planarity and fixing number of inclusion graph of a nilpotent group ⋮ On the fixing number of functigraphs ⋮ Automorphisms and distinguishing numbers of geometric cliques ⋮ Infinite graphs with finite 2-distinguishing cost ⋮ 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 ⋮ 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 ⋮ Graphs of order \(n\) with determining number \(n-3\) ⋮ The determining number of a Cartesian product ⋮ Unnamed Item ⋮ Symmetry parameters for Mycielskian graphs ⋮ Base size sets and determining sets ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ On the distinguishing number of functigraphs ⋮ On maximal det-independent (res-independent) sets in graphs
This page was built for publication: Identifying graph automorphisms using determining sets
