Per-Spectral Characterizations of Bicyclic Networks

Tingzeng Wu and Huazhong Lü

Journal of Applied Mathematics, 2017, vol. 2017, 1-5

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)
http://downloads.hindawi.com/journals/JAM/2017/7541312.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2017/7541312.xml (text/xml)

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:hin:jnljam:7541312

DOI: 10.1155/2017/7541312

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().