The following pages link to Permanental polynomials of graphs (Q1159214):
Displaying 50 items.
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges (Q260053) (← links)
- Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude (Q284749) (← links)
- On the skew-permanental polynomials of orientation graphs (Q284839) (← links)
- The expected characteristic and permanental polynomials of the random Gram matrix (Q405292) (← links)
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation (Q442233) (← links)
- Per-spectral characterizations of graphs with extremal per-nullity (Q491098) (← links)
- Permanental bounds of the Laplacian matrix of trees with given domination number (Q497337) (← links)
- Equality of decomposable symmetrized tensors and *-matrix groups (Q594973) (← links)
- Per-spectral characterizations of bicyclic networks (Q670450) (← links)
- On the permanental polynomials of matrices (Q745925) (← links)
- Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix (Q749619) (← links)
- Almost all trees are co-immanantal (Q751666) (← links)
- Permanent of the Laplacian matrix of trees and bipartite graphs (Q789402) (← links)
- Permanental roots and the star degree of a graph (Q802573) (← links)
- A bound for the permanent of the Laplacian matrix (Q1072613) (← links)
- On the greatest distance between two permanental roots of a matrix (Q1095218) (← links)
- Permanent of the Laplacian matrix of trees with a given matching (Q1107543) (← links)
- On the geometry and Laplacian of a graph (Q1174690) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- The graphs whose permanental polynomials are symmetric (Q1692645) (← links)
- Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial (Q1733727) (← links)
- Computing the permanental polynomials of graphs (Q1735410) (← links)
- Constructing graphs which are permanental cospectral and adjacency cospectral (Q1756130) (← links)
- Immanantal invariants of graphs (Q1779385) (← links)
- Multiplicity of integer roots of polynomials of graphs (Q1902110) (← links)
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) (Q1926033) (← links)
- On the characterizing properties of the permanental polynomials of graphs (Q1932591) (← links)
- On the (signless) Laplacian permanental polynomials of graphs (Q2000570) (← links)
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial (Q2001606) (← links)
- The coefficients of the immanantal polynomial (Q2007498) (← links)
- Unicyclic graphs with second largest and second smallest permanental sums (Q2010574) (← links)
- Permanental sums of graphs of extreme sizes (Q2022135) (← links)
- On the matching and permanental polynomials of graphs (Q2043349) (← links)
- The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs (Q2052128) (← links)
- Sharp bounds on the permanental sum of a graph (Q2053704) (← links)
- On the permanental sum of bicyclic graphs (Q2176222) (← links)
- Computing the permanent of the Laplacian matrices of nonbipartite graphs (Q2230052) (← links)
- Some extremal graphs with respect to permanental sum (Q2272664) (← links)
- Enumeration of permanental sums of lattice graphs (Q2287623) (← links)
- Highly unique network descriptors based on the roots of the permanental polynomial (Q2293292) (← links)
- Generalized permanental polynomials of graphs (Q2311039) (← links)
- On the normalized Laplacian permanental polynomial of a graph (Q2330380) (← links)
- On the permanental sum of graphs (Q2333188) (← links)
- On the bivariate permanent polynomials of graphs (Q2361557) (← links)
- Per-spectral characterizations of some bipartite graphs (Q2409785) (← links)
- The extremal permanental sum for a quasi-tree graph (Q2424575) (← links)
- A note on the permanental roots of bipartite graphs (Q2442268) (← links)
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph (Q2938347) (← links)
- Order of the largest Sachs subgraphs in graphs (Q2961464) (← links)
- Single-hook characters and hamiltonian circuits<sup>∗</sup> (Q3041397) (← links)
