On the distinguishing chromatic number of the Kronecker products of graphs

DOI10.1080/09728600.2023.2250843MaRDI QIDQ6651161

K. Khashyarmanesh, [[Person:5884268|Author name not available (Why is that?)]], Mojgan Afkhami

Publication date: 10 December 2024

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On computing the distinguishing numbers of trees and forests
• The distinguishing chromatic number
• Proper distinguishing colorings with few colors for graphs with girth at least 5
• The distinguishing number of Kronecker product of two graphs
• Symmetry breaking in graphs
• The distinguishing chromatic number of Kneser graphs
• The distinguishing number of Cartesian products of complete graphs
• To the graph theory
• The Kronecker Product of Graphs
• Isomorphic components of Kronecker product of bipartite graphs
• Distinguishing Cartesian powers of graphs

This page was built for publication: On the distinguishing chromatic number of the Kronecker products of graphs

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