Computing the permanental polynomials of graphs
type: Item
instance of: scholarly article
title: Computing the permanental polynomials of graphs
zbMATH Open document ID: 1411.05130
author: Xiaogang Liu
author: Tingzeng Wu
published in: Applied Mathematics and Computation
publication date: 2019-03-28T00:00:00Z
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15A15
zbMATH DE Number: 7044154
zbMATH Keywords: permanent
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: signless Laplacian matrix
zbMATH Keywords: Laplacian permanental polynomial
zbMATH Keywords: signless Laplacian permanental polynomial
MaRDI profile type: Publication
full work available at URL: j.amc.2017.01.052
OpenAlex ID: W2587779384
cites work: Q3659816
cites work: Q3703924
cites work: A bound for the permanent of the Laplacian matrix
cites work: Permanent of the Laplacian matrix of trees and bipartite graphs
cites work: Q4827548
cites work: Q4830188
cites work: Q4903435
cites work: Permanental roots and the star degree of a graph
cites work: Further results on permanental bounds for the Laplacian matrix of trees
cites work: Permanental bounds of the Laplacian matrix of trees with given domination number
cites work: Permanent of the Laplacian matrix of trees with a given matching
cites work: Q4800134
cites work: On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph
cites work: An efficient algorithm for computing permanental polynomials of graphs
cites work: Q3643746
cites work: Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
cites work: Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
cites work: The permanental polynomials of certain graphs
cites work: On the characterizing properties of the permanental polynomials of graphs
cites work: Characterizing properties of permanental polynomials of lollipop graphs
cites work: Permanental polynomials of graphs
cites work: The Laplacian permanental polynomial for trees
cites work: Permanents
cites work: Q4065581
cites work: Generalized Matrix Functions and the Graph Isomorphism Problem
cites work: Q5299380
cites work: The complexity of computing the permanent
cites work: Per-spectral characterizations of graphs with extremal per-nullity
cites work: Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
cites work: On the permanental polynomials of some graphs
cites work: Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
cites work: Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
DOI: 10.1016/J.AMC.2017.01.052
description: scientific article; zbMATH DE number 7044154