Per-Spectral Characterizations of Bicyclic Networks
Spectral techniques are used for the study of several network properties: community detection, bipartition, clustering, design of highly synchronizable networks, and so forth. In this paper, we investigate which kinds of bicyclic networks are determined by their per-spectra. We find that the permane...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2017/7541312 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Spectral techniques are used for the study of several network properties: community detection, bipartition, clustering, design of highly synchronizable networks, and so forth. In this paper, we investigate which kinds of bicyclic networks are determined by their per-spectra. We find that the permanental spectra cannot determine sandglass graphs in general. When we restrict our consideration to connected graphs or quadrangle-free graphs, sandglass graphs are determined by their permanental spectra. Furthermore, we construct countless pairs of per-cospectra bicyclic networks. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |