Abstract
Non-commutative graph theory is an operator space generalization of graph theory. Well known graph parameters such as the independence number and Lovász theta function were first generalized to this setting by Duan, Severini, and Winter [1]. In [10], Stahlke introduces a generalization of the chromatic number of a graph and obtains a Lovász sandwich inequality for certain operator spaces.We introduce two new generalizations of the chromatic number to non-commutative graphs and provide an upper bound on the parameter of Stahlke. We provide a generalization of the graph complement and show the chromatic number of the orthogonal complement of a non-commutative graph is bounded below by its theta number. We also provide a generalization of both Sabidussi's Theorem and Hedetniemi's conjecture to non-commutative graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.