Coloring Sums of Extensions of Certain Graphs
Johan Kok, Saptarshi Bej

TL;DR
This paper introduces and explores the concepts of hi'-chromatic sum and hi^+-chromatic sum for extended paths, cycles, and patterned structured graphs, expanding the understanding of graph coloring sums.
Contribution
It extends the definitions of hi'- and hi^+-chromatic sums to new classes of extended graphs beyond regular graphs.
Findings
Defined hi'- and hi^+-chromatic sums for extended paths and cycles.
Analyzed these sums for patterned structured graphs.
Provided new insights into graph coloring sums for extended graph classes.
Abstract
Recall that the minimum number of colors that allow a proper coloring of graph is called the chromatic number of and denoted by In this paper the concepts of '-chromatic sum and -chromatic sum are introduced. The extended graph of a graph was recently introduced for certain regular graphs. We further the concepts of '-chromatic sum and -chromatic sum to extended paths and cycles. The paper concludes with \emph{patterned structured} graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research
