The extremal permanental sum for a quasi-tree graph

DOI10.1155/2019/4387650zbMath1417.05126OpenAlexW2946032028MaRDI QIDQ2424575

Tingzeng Wu, Huazhong Lü

Publication date: 25 June 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/4387650

Mathematics Subject Classification ID

Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

On the Permanental Polynomial and Permanental Sum of Signed Graphs ⋮ Enumeration of permanental sums of lattice graphs ⋮ On the matching and permanental polynomials of graphs ⋮ Sharp bounds on the permanental sum of a graph

Cites Work

• Unnamed Item
• Further results on the largest matching root of unicyclic graphs
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• On the spectral moment of quasi-trees
• On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
• 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
• Unicyclic graphs with second largest and second smallest permanental sums
• On the permanental sum of graphs
• On the Randić index of quasi-tree graphs
• On the permanental nullity and matching number of graphs

This page was built for publication: The extremal permanental sum for a quasi-tree graph