Unicyclic graphs with second largest and second smallest permanental sums

DOI10.1016/j.amc.2019.01.056zbMath1428.05146OpenAlexW2912271489WikidataQ128476510 ScholiaQ128476510MaRDI QIDQ2010574

Tingzeng Wu, Wa-Sin So

Publication date: 27 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.01.056

zbMATH Keywords

complexitypermanentpermanental polynomialunicyclic graphpermanental sum

Mathematics Subject Classification ID

Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (5)

On the Permanental Polynomial and Permanental Sum of Signed Graphs ⋮ The extremal permanental sum for a quasi-tree graph ⋮ Permanental sums of graphs of extreme sizes ⋮ Enumeration of permanental sums of lattice graphs ⋮ On the matching and permanental polynomials of graphs

Cites Work

• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• 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
• The coefficients of the immanantal polynomial
• Some extremal graphs with respect to permanental sum
• 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: Unicyclic graphs with second largest and second smallest permanental sums