The following pages link to (Q5396536):
Displaying 18 items.
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges (Q260053) (← links)
- On the Pólya conversion problem for permanents and determinants (Q459468) (← links)
- Per-spectral characterizations of graphs with extremal per-nullity (Q491098) (← links)
- On the permanental polynomials of matrices (Q745925) (← links)
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients (Q1669013) (← links)
- Computing the permanental polynomials of graphs (Q1735410) (← links)
- Constructing graphs which are permanental cospectral and adjacency cospectral (Q1756130) (← links)
- On the characterizing properties of the permanental polynomials of graphs (Q1932591) (← links)
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial (Q2001606) (← links)
- Some extremal graphs with respect to permanental sum (Q2272664) (← links)
- Computing permanents of complex diagonally dominant matrices and tensors (Q2317703) (← links)
- On the normalized Laplacian permanental polynomial of a graph (Q2330380) (← links)
- On the permanental sum of graphs (Q2333188) (← links)
- Per-spectral characterizations of some bipartite graphs (Q2409785) (← links)
- A note on the permanental roots of bipartite graphs (Q2442268) (← links)
- Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation (Q3495659) (← links)
- (Q4208430) (← links)
- On the permanental nullity and matching number of graphs (Q5206292) (← links)
