‎Distinguishing index of Kronecker product of two graphs

DOI10.5614//ejgta.2021.9.1.7zbMath1468.05068OpenAlexW3158511556MaRDI QIDQ4958047

Saeid Alikhani, Samaneh Soltani

Publication date: 6 September 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614//ejgta.2021.9.1.7

zbMATH Keywords

Kronecker productdistinguishing numberdistinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Distinguishing graphs by edge-colourings
• Edge motion and the distinguishing index
• On computing the distinguishing numbers of trees and forests
• The distinguishing chromatic number
• Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity
• The distinguishing number and distinguishing index of the lexicographic product of two graphs
• The distinguishing number of Kronecker product of two graphs
• Symmetry breaking in graphs
• The distinguishing number of Cartesian products of complete graphs
• To the graph theory
• The Kronecker Product of Graphs
• Improving upper bounds for the distinguishing index
• Distinguishing number and distinguishing index of certain graphs
• The distinguishing index of the Cartesian product of finite graphs
• The Automorphism Group of a Product of Graphs
• Cardinal multiplication of structures with a reflexive relation
• Distinguishing Cartesian powers of graphs

This page was built for publication: ‎Distinguishing index of Kronecker product of two graphs