Unicyclic graphs with second largest and second smallest permanental sums

DOI10.1016/J.AMC.2019.01.056zbMATH Open1428.05146OpenAlexW2912271489WikidataQ128476510 ScholiaQ128476510MaRDI QIDQ2010574FDOQ2010574

Tingzeng Wu, Wasin 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

complexitypermanental polynomialunicyclic graphpermanentpermanental 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)

Cites Work

• The complexity of computing the permanent
• Permanental polynomials of graphs
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• 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
• The coefficients of the immanantal polynomial
• Highly unique network descriptors based on the roots of the permanental polynomial

Cited In (5)

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

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)