Edge perturbation on graphs with clusters: Adjacency, Laplacian and signless Laplacian eigenvalues
Let G be a simple undirected graph of order n. A cluster in G of order c and degree s, is a pair of vertex subsets (C, S), where C is a set of cardinality |C| =c ≥2 of pairwise co-neighbor vertices sharing the same set S of s neighbors. Assuming that the graph G has k≥1 clusters (C_1, S_1), ..., (C_...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10773/16521 |
| Country: | Portugal |
| Oai: | oai:ria.ua.pt:10773/16521 |