Fractional coloring of product signed graphs

2025/03/26 by Pie Desire Ebode Atangana, Atangana, Pie Desire Ebode
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2503.20901

Abstract

This study examines the fractional chromatic number associated with the direct product of signed graphs. It shows that if (H,τ) is a signed circulant graph G(n,S,T), then for any signed graph (G,σ), the fractional chromatic number of their direct product is the lower number between the fractional chromatic number of (G,σ) and (H,τ).

Related

• Fractional balanced chromatic number and arboricity of planar (signed) graphs
• Circular chromatic number of Cartesian product of signed graphs
• The chromatic number of a signed graph
• Edge coloring of products of signed graphs
• Circular coloring of signed graphs