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




Related Items

On the bivariate permanent polynomials of graphsGraphs whose characteristic and permanental polynomials have coefficients of the same magnitudeOn the skew-permanental polynomials of orientation graphsGraphs determined by the (signless) Laplacian permanental polynomialsOn the Permanental Polynomial and Permanental Sum of Signed GraphsOn the greatest distance between two permanental roots of a matrixMultiplicity of integer roots of polynomials of graphsPermanent of the Laplacian matrix of trees with a given matchingThe Second Immanantal Polynomial and the Centroid of a GraphEquality of decomposable symmetrized tensors and *-matrix groupsOn the adjacency matrix of a complex unit gain graphApplications of multlinear algebraPer-spectral characterizations of some edge-deleted subgraphs of a complete graphOn the permanental sum of bicyclic graphsPer-spectral characterizations of some bipartite graphsPermanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)On the characterizing properties of the permanental polynomials of graphsThe expected characteristic and permanental polynomials of the random Gram matrixOn the roots of (signless) Laplacian permanental polynomials of graphsA study on determination of some graphs by Laplacian and signless Laplacian permanental polynomialsThe graphs whose permanental polynomials are symmetricThe extremal permanental sum for a quasi-tree graphOrder of the largest Sachs subgraphs in graphsPermanents of almost regular complete bipartite graphsComputing the permanental polynomials of bipartite graphs by Pfaffian orientationA note on the permanental roots of bipartite graphsOn the geometry and Laplacian of a graphExtremal hexagonal chains with respect to the coefficients sum of the permanental polynomialComputing the permanent of the Laplacian matrices of nonbipartite graphsComputing the permanental polynomials of graphsPer-spectral characterizations of graphs with extremal per-nullityPer-spectral characterizations of bicyclic networksPermanental bounds of the Laplacian matrix of trees with given domination numberThe Laplacian permanental polynomial for treesConstructing graphs which are permanental cospectral and adjacency cospectralOn the (signless) Laplacian permanental polynomials of graphsExtremal octagonal chains with respect to the coefficients sum of the permanental polynomialThe coefficients of the immanantal polynomialUnicyclic graphs with second largest and second smallest permanental sumsFurther results on permanental bounds for the Laplacian matrix of treesSingle-hook characters and hamiltonian circuitsSome extremal graphs with respect to permanental sumPermanental sums of graphs of extreme sizesImmanantal invariants of graphsEnumeration of permanental sums of lattice graphsOn the permanental nullity and matching number of graphsHighly unique network descriptors based on the roots of the permanental polynomialOn the matching and permanental polynomials of graphsPermanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphsOn the permanental polynomials of matricesThe characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphsSharp bounds on the permanental sum of a graphBounds for the variation of the roots of a polynomial and the eigenvalues of a matrixAlmost all trees are co-immanantalGeneralized permanental polynomials of graphsDevelopments in the theory of graph spectraCharacterizing properties of permanental polynomials of lollipop graphsThe permanent of the Laplacian matrix of a bipartite graphOn the normalized Laplacian permanental polynomial of a graphOn the permanental sum of graphsPermanent of the Laplacian matrix of trees and bipartite graphsMatrices with prescribed submatricesPermanental roots and the star degree of a graphLaplacian matrices of graphs: A surveyA bound for the permanent of the Laplacian matrixPer-spectral and adjacency spectral characterizations of a complete graph removing six edges



Cites Work