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

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

AbstractA graph G is an integral sum graph (sum graph) if its vertices can be labeled with distinct integers (positive integers) so that e = uv is an edge of G if and only if the sum of the labels on vertices u and v is also a label in G. A graph G is perfect if the chromatic number of each of its i...

Full description

Bibliographic Details
Main Authors: Julia K. Abraham, Sajidha P., Lowell W. Beineke, Vilfred V., L. Mary Florida
Format: Article
Language:English
Published: Taylor & Francis Group 2024-01-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Integral sum graph
covering number
independence number
chromatic number
clique number
perfect graphs
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2023.2251046

Internet

https://www.tandfonline.com/doi/10.1080/09728600.2023.2251046

Similar Items