Permanental sums of graphs of extreme sizes
From MaRDI portal
Publication:2022135
DOI10.1016/J.DISC.2021.112353zbMATH Open1462.05189OpenAlexW3134753616MaRDI QIDQ2022135FDOQ2022135
Publication date: 28 April 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112353
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Extremal problems in graph theory (05C35)
Cites Work
- Title not available (Why is that?)
- The complexity of computing the permanent
- Permanental polynomials of graphs
- On the permanental nullity and matching number of graphs
- Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial
- On the permanental sum of graphs
- Some extremal graphs with respect to permanental sum
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
- Unicyclic graphs with second largest and second smallest permanental sums
- Highly unique network descriptors based on the roots of the permanental polynomial
- Enumeration of permanental sums of lattice graphs
Cited In (7)
- The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
- Properties of the extended graph permanent
- Some extremal graphs with respect to permanental sum
- On the Permanental Polynomial and Permanental Sum of Signed Graphs
- Permanents of almost regular complete bipartite graphs
- Sharp bounds on the permanental sum of a graph
- On the roots of (signless) Laplacian permanental polynomials of graphs
This page was built for publication: Permanental sums of graphs of extreme sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022135)