Perfectness of \(G\)-generalized join of graphs

DOI10.1007/978-3-031-25211-2_13OpenAlexW4318023006MaRDI QIDQ6132532

T. Kavaskar

Publication date: 17 August 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-25211-2_13

zbMATH Keywords

perfect graphszero-divisor graphs\(G\)-generalized join of graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Perfect zero-divisor graphs
• The zero-divisor graphs of posets and an application to semigroups
• Commutative Boolean monoids, reduced rings, and the compressed zero-divisor graph
• The strong perfect graph theorem
• On Beck's coloring of posets
• Coloring of commutative rings
• The zero-divisor graph of a commutative ring
• Beck's coloring of a commutative ring
• Reduction graph and its application on algebraic graphs
• Zero-divisor graphs, von Neumann regular rings, and Boolean algebras.
• On the zero-divisor graph of a commutative ring
• The Wiener index of the zero-divisor graph of a finite commutative ring with unity
• Beck's coloring of finite product of commutative ring with unity
• Normal hypergraphs and the perfect graph conjecture
• A Zero Divisor Graph Determined by Equivalence Classes of Zero Divisors
• An Ideal-Based Zero-Divisor Graph of a Commutative Ring
• On Realizing Zero-Divisor Graphs

This page was built for publication: Perfectness of \(G\)-generalized join of graphs