Sigma Chromatic Number of the Middle Graph of Some General Families of Trees of Height 2

Let G be a nontrivial connected graph and letc: V (G) → be a vertex coloring ofG, where adjacent vertices may have the same color. For a vertexv ofG, the color sumσ(v) ofv is the sum of the colors of the vertices adjacent tov. The coloringc is said to be a sigma coloring ofG ifσ(u)σ(v) wheneveru and...

Full description

Saved in:
Bibliographic Details
Main Authors: Manamtam, Jay R.A., Garciano, Agnes D., Tolentino, Mark Anthony C.
Format: text
Published: Archīum Ateneo 2023
Subjects:
Online Access:https://archium.ateneo.edu/mathematics-faculty-pubs/236
https://doi.org/10.1142/s1793557123501437
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Ateneo De Manila University