Graph colouring
1 article · search the full text for this term
-
Chromatic Curling Number of Certain Derived Graphs
Abstract: The curling number of a graph G is dened as the number of times an element in the degree sequence of G appears the maximum number of times. Graph colouring is an assignment of colours, labels or weights to the vertices or edges of a graph. A colouring C of colours c1, c2,..., cl is said to be a minimum parameter colouring if C consists of minimum number of colours …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 10–20 Read article