Per‐Spectral Characterizations of Bicyclic Networks

Tingzeng Wu and Huazhong Lü

Journal of Applied Mathematics, 2017, vol. 2017, issue 1

Abstract: 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.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2017/7541312

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2017:y:2017:i:1:n:7541312

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().