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

(33)

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

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)