Computing the permanental polynomials of graphs
From MaRDI portal
Recommendations
Cites work
- A bound for the permanent of the Laplacian matrix
- An efficient algorithm for computing permanental polynomials of graphs
- Characterizing properties of permanental polynomials of lollipop graphs
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- Further results on permanental bounds for the Laplacian matrix of trees
- Generalized Matrix Functions and the Graph Isomorphism Problem
- scientific article; zbMATH DE number 5627530 (Why is no real title available?)
- scientific article; zbMATH DE number 3811615 (Why is no real title available?)
- scientific article; zbMATH DE number 3929044 (Why is no real title available?)
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- scientific article; zbMATH DE number 1890155 (Why is no real title available?)
- scientific article; zbMATH DE number 2116376 (Why is no real title available?)
- scientific article; zbMATH DE number 2121258 (Why is no real title available?)
- scientific article; zbMATH DE number 6181058 (Why is no real title available?)
- On the characterizing properties of the permanental polynomials of graphs
- On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
- On the permanental polynomials of some graphs
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- Per-spectral characterizations of graphs with extremal per-nullity
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Permanent of the Laplacian matrix of trees with a given matching
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter d
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
- Permanental bounds of the Laplacian matrix of trees with given domination number
- Permanental polynomials of graphs
- Permanental roots and the star degree of a graph
- Permanents
- Remarks on the relations between the permanental and characteristic polynomials of fullerenes
- The complexity of computing the permanent
- The Laplacian permanental polynomial for trees
- The permanental polynomials of certain graphs
Cited in
(23)- On the (signless) Laplacian permanental polynomials of graphs
- The coefficients of the immanantal polynomial
- The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
- Further results on the star degree of graphs
- Computing the permanent of the Laplacian matrices of nonbipartite graphs
- Generalized permanental polynomials of graphs
- On the normalized Laplacian permanental polynomial of a graph
- On the bivariate permanent polynomials of graphs
- Some analytical properties of the permanental polynomial of a graph.
- The permanental polynomials of certain graphs
- Single-hook immanants for complete graphs
- scientific article; zbMATH DE number 2116376 (Why is no real title available?)
- scientific article; zbMATH DE number 1416069 (Why is no real title available?)
- Graphs determined by the (signless) Laplacian permanental polynomials
- On the Permanental Polynomial and Permanental Sum of Signed Graphs
- scientific article; zbMATH DE number 6256206 (Why is no real title available?)
- On the roots of (signless) Laplacian permanental polynomials of graphs
- A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
- Some unicyclic graphs determined by the signless Laplacian permanental polynomial
- Recursive formulae for the Laplacian permanental polynomials of signed graphs
- Further results on permanents of Laplacian matrices of trees
- An efficient algorithm for computing permanental polynomials of graphs
- Solution to an open problem on Laplacian ratio
This page was built for publication: Computing the permanental polynomials of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735410)