E-resources
Peer reviewed
-
Imran, Muhammad; Ali, Yasir; Malik, Mehar Ali; Hasnat, Kiran
Journal of intelligent & fuzzy systems, 01/2021, Volume: 41, Issue: 1Journal Article
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.
