Integral sum graphs G n and G -r,n are perfect graphs

DOI10.1080/09728600.2023.2251046MaRDI QIDQ6651163

Julia K. Abraham, P. Sajidha, L. Mary Florida, L. W. Beineke, V. Vilfred

Publication date: 10 December 2024

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sum graphs over all the integers
• Compositions for perfect graphs
• Normal hypergraphs and the perfect graph conjecture. (Reprint)
• Perfect Graphs and an Application to Optimizing Municipal Services

This page was built for publication: Integral sum graphs G _n and G _-r,n are perfect graphs