On the locating-chromatic number of some classes of graphs and graphs obtained from graph operations
Let G = (V E) be a graph. Let c be a proper k-coloring of a connected graph G and = fC1 C2 : : : Cng be an ordered partition of V (G) induced from the coloring c resulting into color classes. For a vertex v 2 V (G), the color code of v with respect to is de ned as the ordered k-tuple c (v) = (d(v C1...
Saved in:
Main Authors: | Orgasan, Jude Ezekiel M., Tacub, Carmela Joy C. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2016
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/14918 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
The Set Chromatic Numbers of the Middle Graph of Graphs
by: Eugenio, Gerone Russel J, et al.
Published: (2021) -
Sigma chromatic numbers of the middle graph of some families of graphs
by: Manamtam, Jay-R, et al.
Published: (2022) -
On the game chromatic number of Cartesian product of graphs
by: Encinas, Sarah Jane K., et al.
Published: (2010) -
On the Total Set Chromatic Number of Graphs
by: Tolentino, Mark Anthony C, et al.
Published: (2022) -
The Set Chromatic Numbers of the Middle Graph of Tree Families
by: Tolentino, Mark Anthony C, et al.
Published: (2023)