The coefficients of the immanantal polynomial

DOI10.1016/J.AMC.2018.06.057zbMATH Open1428.05210OpenAlexW2885847265WikidataQ129438459 ScholiaQ129438459MaRDI QIDQ2007498FDOQ2007498

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

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

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)

Cites Work

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

Cited In (7)

• The Second Immanantal Polynomial and the Centroid of a Graph
• Some unicyclic graphs determined by the signless Laplacian permanental polynomial
• Unicyclic graphs with second largest and second smallest permanental sums
• 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)