Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
From MaRDI portal
Publication:260053
DOI10.1016/j.dam.2015.09.014zbMath1332.05094OpenAlexW2196040647MaRDI QIDQ260053
Publication date: 18 March 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.09.014
Related Items (13)
On the bivariate permanent polynomials of graphs ⋮ Graphs determined by the (signless) Laplacian permanental polynomials ⋮ Per-spectral characterizations of some bipartite graphs ⋮ A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials ⋮ The graphs whose permanental polynomials are symmetric ⋮ Permanents of almost regular complete bipartite graphs ⋮ Computing the permanental polynomials of graphs ⋮ Per-spectral characterizations of bicyclic networks ⋮ Constructing graphs which are permanental cospectral and adjacency cospectral ⋮ On the permanental nullity and matching number of graphs ⋮ On the matching and permanental polynomials of graphs ⋮ Generalized permanental polynomials of graphs ⋮ On the normalized Laplacian permanental polynomial of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral characterizations of almost complete graphs
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- The spectral characterization of \(\infty\)-graphs
- Per-spectral characterizations of graphs with extremal per-nullity
- A note on the spectral characterization of dumbbell graphs
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Spectral characterizations of lollipop graphs
- On a Laplacian spectral characterization of graphs of index less than 2
- The lollipop graph is determined by its spectrum
- Developments on spectral characterizations of graphs
- A note on the spectral characterization of \(\theta \)-graphs
- Matching theory
- Permanental polynomials of graphs
- Which graphs are determined by their spectrum?
- The complement of the path is determined by its spectrum
- On the permanental polynomials of some graphs
- On the characterizing properties of the permanental polynomials of graphs
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
- Characterizing properties of permanental polynomials of lollipop graphs
- Generalized Matrix Functions and the Graph Isomorphism Problem
This page was built for publication: Per-spectral and adjacency spectral characterizations of a complete graph removing six edges