Chromatic uniqueness of zero-divisor graphs

DOI10.26493/2590-9770.1544.F34MaRDI QIDQ5058160zbMATH OpenOpenAlexFDO

Authors Haneen al-Janabi, Gábor Bacsó

Publication date 19 December 2022

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/2590-9770.1544.f34

zbMATH Keywords

chromatic equivalencechromatic uniquenesszero-divisor graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph polynomials (05C31)

Recommendations

• CHROMATIC POLYNOMIALS AND CHROMATICITY OF ZERO-DIVISOR GRAPHS II
• On the zero-divisor graph of a commutative ring
• The chromatic number of the simple graph associated with a commutative ring
• The zero-divisor graph of \(\mathbb{Z}_n[X\)]]
• The chromatic number of the complementary graph to a simple graph associated with a commutative ring

Cites work

• An introduction to chromatic polynomials
• Coloring of commutative rings
• CYCLES AND SYMMETRIES OF ZERO-DIVISORS
• Graph theory
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• scientific article; zbMATH DE number 2199828 (Why is no real title available?)
• Integral-root polynomials and chromatic uniqueness of graphs
• On a conjecture about uniquely colorable perfect graphs
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• The zero-divisor graph of a commutative ring

Cited in

(1)

• A Note on the Uniqueness of Zero-Divisor Graphs with Loops (Research)

This page was built for publication: Chromatic uniqueness of zero-divisor graphs

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