The chromatic number of joins of signed graphs

DOI10.1007/S00373-021-02387-6MaRDI QIDQ2053734zbMATH OpenOpenAlexFDO

Authors Amelia R. W. Mattern

Publication date 30 November 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.14337

zbMATH Keywords

chromatic numberdeficiencyjoinssigned graphs

Mathematics Subject Classification ID

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

Abstract: We introduce joins of signed graphs and explore the chromatic number of the all-positive and all-negative joins. We prove an analogue to the theorem that the chromatic number of the join of two graphs equals the sum of their chromatic numbers. Given two signed graphs, the chromatic number of the all-positive and all-negative join is usually less than the sum of their chromatic numbers, by an amount that depends on the new concept of deficiency of a signed-graph coloration.

Recommendations

• The chromatic spectrum of signed graphs
• The chromatic number of a signed graph
• Hajós-like theorem for signed graphs
• How colorful the signed graph?
• On the signed chromatic number of some classes of graphs

Cites work

• Net Laplacian controllability for joins of signed graphs
• On the spectrum of the net Laplacian matrix of a signed graph
• Signed graph coloring
• The chromatic number of a signed graph

Cited in

(2)

• The homomorphism and coloring of the direct product of signed graphs
• The chromatic number of a signed graph

This page was built for publication: The chromatic number of joins of signed graphs

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