The Spectrum of the Coloration Matrix for the Complete Partite Graph

subhi ruzieh's picture
Journal Title, Volume, Page: 
Hebron University Research Journal (A). Vol.(5), pp.(93 –99)
Year of Publication: 
2011
Authors: 
Subhi Ruzieh
An-Najah National University
Current Affiliation: 
Department of Mathematics, Faculty of Science, An-Najah National University, Nablus, Palestine
Preferred Abstract (Original): 

This paper talks about eigenvalues of graphs and finding them through making use of the coloration partition. We first define the concept of coloration. We then apply it to compute eigenvalues of some graphs. The concentration will be on graphs having a nontrivial coloration like the complete bipartite graphs K(m, n) and the complete 3 - partite graphs K(m, n, p). The idea can be carried through to the complete n-partite graphs, but the computations then will be much more complicated.

AttachmentSize
The Spectrum of the Coloration Matrix for the Complete Partite Graph394.1 KB