Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
From MaRDI portal
Publication:2938347
DOI10.1080/03081087.2013.869592zbMath1308.05063OpenAlexW2172286109MaRDI QIDQ2938347
Heping Zhang, Hong-Jian Lai, Tingzeng Wu
Publication date: 14 January 2015
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2013.869592
Graph polynomials (05C31) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (19)
On the bivariate permanent polynomials of graphs ⋮ On the skew-permanental polynomials of orientation graphs ⋮ Graphs determined by the (signless) Laplacian permanental polynomials ⋮ On the Permanental Polynomial and Permanental Sum of Signed Graphs ⋮ 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 ⋮ \( A_\alpha\)-spectral characterizations of some joins ⋮ Computing the permanental polynomials of graphs ⋮ Per-spectral characterizations of graphs with extremal per-nullity ⋮ 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 ⋮ The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs ⋮ Sharp bounds on the permanental sum of a graph ⋮ Generalized permanental polynomials of graphs ⋮ On the normalized Laplacian permanental polynomial of a graph ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
Cites Work
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- The complexity of computing the permanent
- An efficient algorithm for computing permanental polynomials of graphs
- Some graphs determined by their spectra
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Spectral characterizations of lollipop graphs
- A note on the spectral characterization of \(\theta \)-graphs
- 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
- On the spectral characterization of T-shape trees
- A note on the permanental roots of bipartite graphs
- Generalized Matrix Functions and the Graph Isomorphism Problem
- Cospectral Graphs and Digraphs
- Schwenk-Like Formulas for Weighted Digraphs
This page was built for publication: Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
