‎Distinguishing index of Kronecker product of two graphs

DOI10.5614//EJGTA.2021.9.1.7MaRDI QIDQ4958047zbMATH OpenOpenAlexFDO

Authors Saeid Alikhani, Samaneh Soltani

Publication date 6 September 2021

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

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

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

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

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

Cites work

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

Cited in

(2)

• The distinguishing number of Kronecker product of two graphs
• Distinguishing number and distinguishing index of strong 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)