Title: Chromatic spectrum of some classes of 2-regular bipartite colored graphs
Abstract: Chromatic spectrum of a colored graph G is a multiset of eigenvalues of colored adjacency matrix of G. The nullity of a disconnected graph is equal to sum of nullities of its components but we show that this result does not hold for colored graphs. In this paper, we investigate the chromatic spectrum of three different classes of 2-regular bipartite colored graphs. In these classes of graphs, it is proved that the nullity of G is not sum of nullities of components of G. We also highlight some important properties and conjectures to extend this problem to general graphs.
Publication Year: 2021
Publication Date: 2021-06-18
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot