Pages that link to "Item:Q869991"

The following pages link to Identifying graph automorphisms using determining sets (Q869991):

Displaying 39 items.

• The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
• Infinite graphs with finite 2-distinguishing cost (Q490268) (← links)
• Automatic proof of graph nonisomorphism (Q841683) (← links)
• Destroying automorphisms by fixing nodes (Q856873) (← links)
• Using determining sets to distinguish Kneser graphs (Q870080) (← links)
• Automorphisms and distinguishing numbers of geometric cliques (Q938315) (← links)
• Determining sets, resolving sets, and the exchange property (Q968219) (← links)
• On the fixing sets of dihedral groups (Q1625814) (← links)
• The full automorphism groups, determining sets and resolving sets of coprime graphs (Q1741589) (← links)
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341) (← links)
• Automorphism group and other properties of zero component graph over a vector space (Q2035704) (← links)
• Graphs of order \(n\) with determining number \(n-3\) (Q2042201) (← links)
• Symmetry parameters for Mycielskian graphs (Q2073195) (← links)
• On maximal det-independent (res-independent) sets in graphs (Q2115159) (← links)
• Computing graph automorphism from partial solutions (Q2272212) (← links)
• Some properties of alternating group networks (Q2274504) (← links)
• Base size sets and determining sets (Q2324487) (← links)
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
• On the distinguishing number of functigraphs (Q2333653) (← links)
• Identifying codes on directed de Bruijn graphs (Q2416416) (← links)
• Levenshtein graphs: resolvability, automorphisms \& determining sets (Q2689484) (← links)
• Symmetry breaking in tournaments (Q2857409) (← links)
• The determining number of a Cartesian product (Q3632997) (← links)
• THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH (Q4956581) (← links)
• On the fixing number of functigraphs (Q4991413) (← links)
• The isometry group of phylogenetic tree space is $S_n$ (Q5117319) (← links)
• Planarity and fixing number of inclusion graph of a nilpotent group (Q5133892) (← links)
• (Q5137479) (← links)
• Automorphism group and fixing number of the orthogonality graph based on rank one upper triangular matrices (Q5157759) (← links)
• Determining Number of Some Families of Cubic Graphs (Q5854471) (← links)
• Fixing numbers for matroids (Q5964981) (← links)
• Determining Number of Kneser Graphs: Exact Values and Improved Bounds (Q6041430) (← links)
• Distinguishing orthogonality graphs (Q6056750) (← links)
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
• The automorphism group and fixing number of the orthogonality graph of the full matrix ring (Q6163896) (← links)
• Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups (Q6184988) (← links)
• Edge-locating coloring of graphs (Q6571562) (← links)
• The base size of the symmetric group acting on subsets (Q6614049) (← links)
• On automorphisms and fixing number of co-normal product of graphs (Q6669292) (← links)