Per-spectral characterizations of bicyclic networks
From MaRDI portal
Publication:670450
DOI10.1155/2017/7541312zbMath1437.05155OpenAlexW2617063551WikidataQ59145180 ScholiaQ59145180MaRDI QIDQ670450
Publication date: 18 March 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/7541312
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- Per-spectral characterizations of graphs with extremal per-nullity
- The complexity of computing the permanent
- Developments on spectral characterizations of graphs
- Spectral characterizations of sandglass graphs
- Permanental polynomials of graphs
- Which graphs are determined by their spectrum?
- On the characterizing properties of the permanental polynomials of graphs
- Per-spectral characterizations of some bipartite graphs
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
- Graph Spectra for Complex Networks
- Cospectral Graphs and Digraphs
This page was built for publication: Per-spectral characterizations of bicyclic networks