The b-chromatic number of power graphs of paths and cycles

Let G be a graph on the vertices n x x x ,..., , 2 1 . 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 num...

Full description

Saved in:
Bibliographic Details
Main Author: San Diego, Immanuel T.
Format: text
Language:English
Published: Animo Repository 2005
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_masteral/3289
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
Be the first to leave a comment!
You must be logged in first