Pages that link to "Item:Q870080"

The following pages link to Using determining sets to distinguish Kneser graphs (Q870080):

Displaying 30 items.

• Infinite graphs with finite 2-distinguishing cost (Q490268) (← links)
• Distinguishing labeling of the actions of almost simple groups. (Q663093) (← links)
• Identifying graph automorphisms using determining sets (Q869991) (← links)
• Automorphisms and distinguishing numbers of geometric cliques (Q938315) (← links)
• Determining sets, resolving sets, and the exchange property (Q968219) (← links)
• A note on the asymptotic and computational complexity of graph distinguishability (Q1385847) (← links)
• The list distinguishing number of Kneser graphs (Q1693128) (← links)
• The full automorphism groups, determining sets and resolving sets of coprime graphs (Q1741589) (← links)
• The distinguishing chromatic number of Kneser graphs (Q1953404) (← links)
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341) (← links)
• The cost of 2-distinguishing hypercubes (Q2037589) (← links)
• Graphs of order \(n\) with determining number \(n-3\) (Q2042201) (← links)
• Symmetry parameters for Mycielskian graphs (Q2073195) (← links)
• Trees with distinguishing number two (Q2176156) (← links)
• On the distinguishing number of functigraphs (Q2333653) (← links)
• Distinguishing number of hierarchical products of graphs (Q2662361) (← links)
• Symmetry breaking in tournaments (Q2857409) (← links)
• Distinguishing geometric graphs (Q3419706) (← links)
• The determining number of a Cartesian product (Q3632997) (← links)
• (Q4824884) (← links)
• THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH (Q4956581) (← links)
• Paint cost and the frugal distinguishing number (Q5058214) (← links)
• Symmetry parameters of various hypercube families (Q5058218) (← links)
• Distinguishing Generalized Mycielskian Graphs (Q5090527) (← links)
• (Q5137479) (← links)
• Determining Number of Kneser Graphs: Exact Values and Improved Bounds (Q6041430) (← links)
• On the connectivity of the disjointness graph of segments of point sets in general position in the plane (Q6045406) (← links)
• Distinguishing orthogonality graphs (Q6056750) (← links)
• Distinguishing threshold of graphs (Q6074586) (← links)
• Symmetry parameters of two-generator circulant graphs (Q6644272) (← links)