Using determining sets to distinguish Kneser graphs

MaRDI QIDQ870080zbMATH OpenFDO

Authors Michael O. Albertson, Debra L. Boutin

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, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r20.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

distinguishing labeling

Mathematics Subject Classification ID

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

Recommendations

• The distinguishing chromatic number of Kneser graphs
• The list distinguishing number of Kneser graphs
• The determining number of Kneser graphs
• The cost of 2-distinguishing selected Kneser graphs and hypercubes
• Identifying graph automorphisms using determining sets

Cited in

(35)

• On the connectivity of the disjointness graph of segments of point sets in general position in the plane
• The cost of 2-distinguishing selected Kneser graphs and hypercubes
• Symmetry parameters of various hypercube families
• On the distinguishing number of functigraphs
• The full automorphism groups, determining sets and resolving sets of coprime graphs
• Determining number and cost of generalized Mycielskian graphs
• Determining Number of Kneser Graphs: Exact Values and Improved Bounds
• Determining sets, resolving sets, and the exchange property
• A note on the asymptotic and computational complexity of graph distinguishability
• The determining number of Kneser graphs
• scientific article; zbMATH DE number 2113454 (Why is no real title available?)
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
• Identifying graph automorphisms using determining sets
• The cost of 2-distinguishing hypercubes
• Distinguishing threshold of graphs
• Trees with distinguishing number two
• The cost number and the determining number of a graph
• Paint cost spectrum of perfect k-ary trees
• Distinguishing number of hierarchical products of graphs
• The distinguishing chromatic number of Kneser graphs
• Symmetry breaking in tournaments
• The determining number of a Cartesian product
• Distinguishing geometric graphs
• Symmetry parameters of two-generator circulant graphs
• Infinite graphs with finite 2-distinguishing cost
• Paint cost and the frugal distinguishing number
• On some parameters related to fixing sets in graphs
• Symmetry parameters for Mycielskian graphs
• The list distinguishing number of Kneser graphs
• Distinguishing labeling of the actions of almost simple groups.
• Automorphisms and distinguishing numbers of geometric cliques
• The determining number and cost of 2-distinguishing of select Kneser graphs
• Distinguishing orthogonality graphs
• Graphs of order n with determining number n-3
• Distinguishing generalized Mycielskian graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870080)