Permanental polynomials of graphs
From MaRDI portal
Publication:1159214
DOI10.1016/0024-3795(81)90026-4zbMath0474.05049OpenAlexW2071169144MaRDI QIDQ1159214
Kenneth R. Rebman, Russell Merris, William Watkins
Publication date: 1981
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(81)90026-4
Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
On the bivariate permanent polynomials of graphs ⋮ Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude ⋮ 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 ⋮ On the greatest distance between two permanental roots of a matrix ⋮ Multiplicity of integer roots of polynomials of graphs ⋮ Permanent of the Laplacian matrix of trees with a given matching ⋮ The Second Immanantal Polynomial and the Centroid of a Graph ⋮ Equality of decomposable symmetrized tensors and *-matrix groups ⋮ On the adjacency matrix of a complex unit gain graph ⋮ Applications of multlinear algebra ⋮ Per-spectral characterizations of some edge-deleted subgraphs of a complete graph ⋮ On the permanental sum of bicyclic graphs ⋮ Per-spectral characterizations of some bipartite graphs ⋮ Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) ⋮ On the characterizing properties of the permanental polynomials of graphs ⋮ The expected characteristic and permanental polynomials of the random Gram matrix ⋮ On the roots of (signless) Laplacian permanental polynomials of graphs ⋮ A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials ⋮ The graphs whose permanental polynomials are symmetric ⋮ The extremal permanental sum for a quasi-tree graph ⋮ Order of the largest Sachs subgraphs in graphs ⋮ Permanents of almost regular complete bipartite graphs ⋮ Computing the permanental polynomials of bipartite graphs by Pfaffian orientation ⋮ A note on the permanental roots of bipartite graphs ⋮ On the geometry and Laplacian of a graph ⋮ Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial ⋮ Computing the permanent of the Laplacian matrices of nonbipartite graphs ⋮ Computing the permanental polynomials of graphs ⋮ Per-spectral characterizations of graphs with extremal per-nullity ⋮ Per-spectral characterizations of bicyclic networks ⋮ Permanental bounds of the Laplacian matrix of trees with given domination number ⋮ The Laplacian permanental polynomial for trees ⋮ Constructing graphs which are permanental cospectral and adjacency cospectral ⋮ On the (signless) Laplacian permanental polynomials of graphs ⋮ Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial ⋮ The coefficients of the immanantal polynomial ⋮ Unicyclic graphs with second largest and second smallest permanental sums ⋮ Further results on permanental bounds for the Laplacian matrix of trees ⋮ Single-hook characters and hamiltonian circuits∗ ⋮ Some extremal graphs with respect to permanental sum ⋮ Permanental sums of graphs of extreme sizes ⋮ Immanantal invariants of graphs ⋮ Enumeration of permanental sums of lattice graphs ⋮ On the permanental nullity and matching number of graphs ⋮ Highly unique network descriptors based on the roots of the permanental polynomial ⋮ On the matching and permanental polynomials of graphs ⋮ Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs ⋮ On the permanental polynomials of matrices ⋮ The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs ⋮ Sharp bounds on the permanental sum of a graph ⋮ Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix ⋮ Almost all trees are co-immanantal ⋮ Generalized permanental polynomials of graphs ⋮ Developments in the theory of graph spectra ⋮ Characterizing properties of permanental polynomials of lollipop graphs ⋮ The permanent of the Laplacian matrix of a bipartite graph ⋮ On the normalized Laplacian permanental polynomial of a graph ⋮ On the permanental sum of graphs ⋮ Permanent of the Laplacian matrix of trees and bipartite graphs ⋮ Matrices with prescribed submatrices ⋮ Permanental roots and the star degree of a graph ⋮ Laplacian matrices of graphs: A survey ⋮ A bound for the permanent of the Laplacian matrix ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on cospectral graphs
- Two problems involving Schur functions
- On inverse multiplicative eigenvalue problems for matrices
- Real permanental roots of doubly stochastic matrices
- The existence of matrices with prescribed characteristic and permanental polynomials
- Parallel concepts in graph theory
- Eigenschaften der Permanentefunktion
- A conjecture and some problems on permanents
- The characteristic polynomial of a graph
- A class of counterexamples on permanents
- Counterexamples to a conjecture of G. N. de Oliveira
- Matrices with prescribed off-diagonal elements
- Counterexamples to conjectures of Ryser and de Oliveira
- Regular equimodular sets of matrices for generalized matrix functions
- On the Exceptional Case in a Characterization of the Arcs of a Complete Graph
- The Determinant of the Adjacency Matrix of a Graph
- Hypergraphs, characteristic polynomials and permutation characters
- On the pseudocharacteristic polynomial of K. Bogart and J. Gordon †
- Eigenvectors of acyclic matrices
- The Hadamard Theorem for Permanents
- Permanents
- Generalized Matrix Functions and the Graph Isomorphism Problem
- Localization of the Zeros of the Permanent of a Characteristic Matrix
- Monotonicity of Positive Semidefinite Hermitian Matrices
- Cospectral Graphs and Digraphs
- On the Multiplicative Inverse Eigenvalue Problem