The distinguishing number and distinguishing index of the lexicographic product of two graphs (Q1649920): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Symmetry breaking in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing number and distinguishing index of certain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of lexicographic products / 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: The distinguishing index of the Cartesian product of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the group of the composition of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing graphs by edge-colourings / 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: Distinguishing colorings of Cartesian products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The composition of graphs / rank
 
Normal rank

Revision as of 01:13, 16 July 2024

scientific article
Language Label Description Also known as
English
The distinguishing number and distinguishing index of the lexicographic product of two graphs
scientific article

    Statements

    Identifiers