Permanental sums of graphs of extreme sizes

DOI10.1016/j.disc.2021.112353zbMath1462.05189OpenAlexW3134753616MaRDI QIDQ2022135

Tingzeng Wu, Wa-Sin So

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

zbMATH Keywords

permanentpermanental polynomialextremal graphpermanental sum

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

On the Permanental Polynomial and Permanental Sum of Signed Graphs ⋮ On the roots of (signless) Laplacian permanental polynomials of graphs ⋮ Permanents of almost regular complete bipartite graphs ⋮ The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs ⋮ Sharp bounds on the permanental sum of a graph

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• Permanental polynomials of graphs
• 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
• Unicyclic graphs with second largest and second smallest permanental sums
• Some extremal graphs with respect to permanental sum
• Enumeration of permanental sums of lattice graphs
• Highly unique network descriptors based on the roots of the permanental polynomial
• On the permanental sum of graphs
• On the permanental nullity and matching number of graphs

This page was built for publication: Permanental sums of graphs of extreme sizes