Using determining sets to distinguish Kneser graphs

zbMath1114.05089MaRDI QIDQ870080

Debra L. Boutin, Michael O. Albertson

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/127568

zbMATH Keywords

distinguishing labeling

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (23)

THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH ⋮ Paint cost and the frugal distinguishing number ⋮ Symmetry parameters of various hypercube families ⋮ Distinguishing number of hierarchical products of graphs ⋮ Determining Number of Kneser Graphs: Exact Values and Improved Bounds ⋮ On the connectivity of the disjointness graph of segments of point sets in general position in the plane ⋮ Distinguishing orthogonality graphs ⋮ Distinguishing threshold of graphs ⋮ The list distinguishing number of Kneser graphs ⋮ Distinguishing labeling of the actions of almost simple groups. ⋮ 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 ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Determining sets, resolving sets, and the exchange property ⋮ Unnamed Item ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ The cost of 2-distinguishing hypercubes ⋮ Graphs of order \(n\) with determining number \(n-3\) ⋮ The determining number of a Cartesian product ⋮ Unnamed Item ⋮ Symmetry parameters for Mycielskian graphs ⋮ On the distinguishing number of functigraphs

This page was built for publication: Using determining sets to distinguish Kneser graphs