On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under spectral graph theory. In this paper, we compute a...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2016/5906801 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|