Vector coloring the categorical product of graphs
A vector t-coloring of a graph is an assignment of real vectors p1, … , pn to its vertices such that piTpi=t-1, for all i= 1 , … , n and piTpj≤-1, whenever i and j are adjacent. The vector chromatic number of G is the smallest number t≥ 1 for which a vector t-coloring of G exists. For a graph H and...
Saved in:
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/142847 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |