The b-chromatic number of power graphs of paths and cycles
Let G be a graph on the vertices n x , x ,..., x 1 2 . Its p-th power graph p G , has the same vertex set as G, with two distinct vertices of G adjacent in p G whenever there is a path of length at most p between them in G. The b-chromatic number of G, denoted by ϕ(G), is defined as the maximum numb...
Saved in:
Main Author: | San Diego, Immanuel T. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2005
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/5892 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/12714/viewcontent/CDTG003897_F_Partial.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
The b-chromatic number of power graphs of paths and cycles
by: San Diego, Immanuel T.
Published: (2005) -
The Set Chromatic Numbers of the Middle Graph of Graphs
by: Eugenio, Gerone Russel J, et al.
Published: (2021) -
On the sigma chromatic number of the join of a finite number of paths and cycles
by: Garciano, Agnes, et al.
Published: (2019) -
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)