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: | Godsil, Chris, Roberson, David E., Rooney, Brendan, Šámal, Robert, Varvitsiotis, Antonios |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
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 |
Similar Items
-
Graph homomorphisms via vector colorings
by: Godsil, Chris, et al.
Published: (2020) -
Relaxations of graph isomorphism
by: Mančinska, Laura, et al.
Published: (2018) -
The Set Chromatic Numbers of the Middle and Total Graphs of a Graph
by: Eugenio, Gerone Russel
Published: (2020) -
Sigma Chromatic Number of the Middle Graph of Some Families of Graphs
by: Manamtam, Jay-R
Published: (2021) -
The Pancake Graph of Order 10 Is 4-Colorable
by: Tan, Renzo Roel Perez, et al.
Published: (2023)