Using determining sets to distinguish Kneser graphs
From MaRDI portal
Publication:870080
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
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Unnamed Item, THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH, Paint cost and the frugal distinguishing number, Symmetry parameters of various hypercube families, Distinguishing Generalized Mycielskian 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, Infinite graphs with finite 2-distinguishing cost, Distinguishing labeling of the actions of almost simple groups., Automorphisms and distinguishing numbers of geometric cliques, Determining sets, resolving sets, and the exchange property, The list distinguishing number of Kneser graphs, The full automorphism groups, determining sets and resolving sets of coprime graphs, 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\), Symmetry parameters for Mycielskian graphs, On the distinguishing number of functigraphs, Distinguishing number of hierarchical products of graphs, Unnamed Item, The determining number of a Cartesian product
