Unicyclic graphs with second largest and second smallest permanental sums
From MaRDI portal
Publication:2010574
Recommendations
Cites work
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
- Highly unique network descriptors based on the roots of the permanental polynomial
- On the permanental nullity and matching number of graphs
- On the permanental sum of graphs
- Permanental polynomials of graphs
- Some extremal graphs with respect to permanental sum
- The coefficients of the immanantal polynomial
- The complexity of computing the permanent
Cited in
(9)- On the permanental sum of graphs
- Sharp bounds on the permanental sum of a graph
- On the matching and permanental polynomials of graphs
- On the permanental sum of bicyclic graphs
- Permanental sums of graphs of extreme sizes
- The extremal permanental sum for a quasi-tree graph
- On the Permanental Polynomial and Permanental Sum of Signed Graphs
- Extremal unicyclic graphs with respect to permanent sum
- Enumeration of permanental sums of lattice graphs
This page was built for publication: Unicyclic graphs with second largest and second smallest permanental sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010574)