Photo from academic.microsoft.com
Let G be a simple connected graph and c : V (G) → ℕ a coloring of the vertices in G. For any v ∈ V (G), let σ(v) be… Click to show full abstract
Let G be a simple connected graph and c : V (G) → ℕ a coloring of the vertices in G. For any v ∈ V (G), let σ(v) be the sum of colors of the vertices adjacent to v. Then c is called a sigma colorin...
Keywords:
sigma chromatic;
finite number;
join finite;
number;
number join;
chromatic number
Journal Title: Asian-european Journal of Mathematics
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Asian-european Journal of Mathematics
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!