The Spectrum of the Coloration Matrix for the Complete Partite Graph

dc.contributor.author	Subhi Ruzieh
dc.date.accessioned	2017-05-03T09:37:03Z
dc.date.available	2017-05-03T09:37:03Z
dc.date.issued	2010-08-02
dc.description.abstract	<p>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 become more difficult to be concluded.</p>	en
dc.description.abstract	<p>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 become more difficult to be concluded.</p>	ar
dc.identifier.uri	https://hdl.handle.net/20.500.11888/9588
dc.title	The Spectrum of the Coloration Matrix for the Complete Partite Graph	en
dc.title	The Spectrum of the Coloration Matrix for the Complete Partite Graph	ar
dc.type	Other

Now showing 1 - 1 of 1