Using determining sets to distinguish Kneser graphs

zbMATH Open1114.05089MaRDI QIDQ870080FDOQ870080

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

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

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

zbMATH Keywords

distinguishing labeling

Mathematics Subject Classification ID

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

Cited In (29)

• THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH
• 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 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
• Identifying graph automorphisms using determining sets
• Distinguishing threshold of graphs
• The cost of 2-distinguishing hypercubes
• Trees with distinguishing number two
• Distinguishing number of hierarchical products of graphs
• Distinguishing Generalized Mycielskian Graphs
• Symmetry breaking in tournaments
• The determining number of a Cartesian product
• Symmetry parameters of two-generator circulant graphs
• Distinguishing geometric graphs
• Paint cost and the frugal distinguishing number
• Infinite graphs with finite 2-distinguishing cost
• 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
• Distinguishing orthogonality graphs
• Graphs of order \(n\) with determining number \(n-3\)
• On the connectivity of the disjointness graph of segments of point sets in general position in the plane

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)