The distinguishing number of Cartesian products of complete graphs (Q2427541): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2007.11.018 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2007.11.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081088856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Cartesian powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing number of the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum distinguishing number of a group / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing number of the direct product and wreath product action. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the distinguishing numbers of trees and forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the local distinguishing numbers of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing colorings of Cartesian products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Cartesian powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing labellings of group action on vector spaces and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cartesian powers of graphs can be distinguished by two labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the asymptotic and computational complexity of graph distinguishability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing numbers for graphs and groups / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2007.11.018 / rank
 
Normal rank

Latest revision as of 13:56, 18 December 2024

scientific article
Language Label Description Also known as
English
The distinguishing number of Cartesian products of complete graphs
scientific article

    Statements

    The distinguishing number of Cartesian products of complete graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2008
    0 references
    distinguishing number
    0 references
    vertex labeling
    0 references
    Cartesian product
    0 references
    switching lemma
    0 references

    Identifiers