The homomorphism and coloring of the direct product of signed graphs

Chao Wen, Qiang Sun, Hongyan Cai, Huanhuan Guan and Chao Zhang

Applied Mathematics and Computation, 2024, vol. 476, issue C

Abstract: Hedetniemi's conjecture, a significant problem in graph theory, was disproved by Shitov in 2019. This breakthrough stimulates us to consider the signed graphs version of Hedetniemi's conjecture, where signed graphs are graphs with an assignment of {±1} to the edges. In this paper, we provide counterexamples to the signed analog of Hedetniemi's conjecture. Nevertheless, we show that the chromatic number of the product is determined by its factors in some instances, i.e., if Γ→Θ and (Θ,π) is balanced, then χ((Γ,σ)×(Θ,π))=χ((Γ,σ)). As a byproduct, we investigate the homomorphisms from a factor of (Γ,σ)×(Θ,π) to the other, say from (Γ,σ) to (Θ,π). We find that if such homomorphisms exist, then the chromatic number of (Γ,+) provides a lower bound for χ((Γ,σ)×(Θ,π)). Moreover, if Γ is a core, then the number of balanced subgraphs isomorphic to (Γ,+) in (Γ,σ)×(Θ,π) is equal to the number of such homomorphisms.

Keywords: Signed graph; Direct product; Chromatic number; Homomorphism; Hedetniemi's conjecture (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324002480
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:476:y:2024:i:c:s0096300324002480

DOI: 10.1016/j.amc.2024.128783

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().