The coefficients of the immanantal polynomial

DOI10.1016/j.amc.2018.06.057zbMath1428.05210OpenAlexW2885847265WikidataQ129438459 ScholiaQ129438459MaRDI QIDQ2007498

Hui Qu, Guihai Yu

Publication date: 22 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.2018.06.057

zbMATH Keywords

adjacency matrixLaplacian matrixsignless Laplacian matriximmanantal polynomial

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 (5)

Further results on the star degree of graphs ⋮ On the permanental sum of bicyclic graphs ⋮ The extremal permanental sum for a quasi-tree graph ⋮ The second immanantal polynomials of Laplacian matrices of unicyclic graphs ⋮ Unicyclic graphs with second largest and second smallest permanental sums

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Almost all trees are co-immanantal
• Signless Laplacians of finite graphs
• Permanental polynomials of graphs
• Hook immanantal inequalities for Laplacians of trees
• Hook immanantal inequalities for trees explained
• Computing the permanental polynomials of graphs
• Network entropies based on independent sets and matchings
• Immanantal invariants of graphs
• On the permanental polynomials of some graphs
• Highly unique network descriptors based on the roots of the permanental polynomial
• Analyzing lattice networks through substructures
• On the permanental sum of graphs
• Vertex-based and edge-based centroids of graphs
• Hook immanantal and Hadamard inequalities for \(q\)-Laplacians of trees
• A note on the permanental roots of bipartite graphs
• A \(q\)-analogue of the distance matrix of a tree
• Single-hook characters and hamiltonian circuits^∗
• The Laplacian Spectrum of a Graph
• The Second Immanantal Polynomial and the Centroid of a Graph
• A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
• Permanents of graphs with cut vertices
• Immanant Inequalities for Laplacians of Trees
• On the permanental nullity and matching number of graphs
• Edge-grafting theorems on permanents of the Laplacian matrices of graphs and their applications

This page was built for publication: The coefficients of the immanantal polynomial