On the normalized Laplacian permanental polynomial of a graph

DOI10.1007/s41980-018-00199-8zbMath1423.05086OpenAlexW2914362205WikidataQ128528754 ScholiaQ128528754MaRDI QIDQ2330380

Xiaogang Liu, Tingzeng Wu

Publication date: 22 October 2019

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-018-00199-8

zbMATH Keywords

permanentnormalized Laplacian matrixnormalized Laplacian permanental 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 (1)

The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
• Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude
• On the skew-permanental polynomials of orientation graphs
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Per-spectral characterizations of graphs with extremal per-nullity
• Permanental bounds of the Laplacian matrix of trees with given domination number
• The complexity of computing the permanent
• An efficient algorithm for computing permanental polynomials of graphs
• Permanent of the Laplacian matrix of trees and bipartite graphs
• Permanental roots and the star degree of a graph
• A bound for the permanent of the Laplacian matrix
• Permanent of the Laplacian matrix of trees with a given matching
• Permanental polynomials of graphs
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
• Computing the permanental polynomials of graphs
• On the permanental polynomials of some graphs
• Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
• On the characterizing properties of the permanental polynomials of graphs
• On the Laplacian coefficients of signed graphs
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
• Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
• Further results on permanental bounds for the Laplacian matrix of trees
• The Laplacian permanental polynomial for trees
• On the permanental nullity and matching number of graphs
• Permanental polynomials of skew adjacency matrices of oriented graphs
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph
• Characterizing properties of permanental polynomials of lollipop graphs
• Permanents
• Generalized Matrix Functions and the Graph Isomorphism Problem

This page was built for publication: On the normalized Laplacian permanental polynomial of a graph