The coefficients of the immanantal polynomial

DOI10.1016/J.AMC.2018.06.057MaRDI QIDQ2007498zbMATH OpenOpenAlexWikidataFDO

Authors Guihai Yu, Hui Qu

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

Laplacian matrixadjacency matrixsignless Laplacian matriximmanantal polynomial

Mathematics Subject Classification ID

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

Recommendations

• Immanants of combinatorial matrices
• On the (signless) Laplacian permanental polynomials of graphs
• Almost all trees share a complete set of immanantal polynomials
• Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph
• Almost all trees are co-immanantal

Cites work

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

Cited in

(8)

• On the second immanantal polynomials of graphs
• The Second Immanantal Polynomial and the Centroid of a Graph
• Unicyclic graphs with second largest and second smallest permanental sums
• Some unicyclic graphs determined by the signless Laplacian permanental polynomial
• The second immanantal polynomials of Laplacian matrices of unicyclic graphs
• Further results on the star degree of graphs
• The extremal permanental sum for a quasi-tree graph
• On the permanental sum of bicyclic graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007498)