‎Distinguishing index of Kronecker product of two graphs

DOI10.5614//EJGTA.2021.9.1.7zbMATH Open1468.05068OpenAlexW3158511556MaRDI QIDQ4958047FDOQ4958047

Authors: 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

Recommendations

• The distinguishing number of Kronecker product of two graphs
• The distinguishing index of the Cartesian product of finite graphs
• Distinguishing number and distinguishing index of strong product of two graphs
• The distinguishing number and distinguishing index of the lexicographic product of two graphs
• Distinguishing number and distinguishing index of certain graphs
• The distinguishing index of the Cartesian product of countable graphs
• Distinguishing number and distinguishing index of join of two specific graphs
• Edge-distinguishing index of a graph
• Some remarks on the Kronecker product of graphs
• Degree distance and Gutman index of two graph products

zbMATH Keywords

Kronecker productdistinguishing numberdistinguishing index

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Distinguishing number and distinguishing index of strong product of two graphs
• The distinguishing number of Kronecker product of two graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958047)