Edge-grafting theorems on permanents of Laplacian matrices of graphs and their applications

MaRDI QIDQ5746785zbMATH OpenFDO

Authors Shuchao Li, Yan Li, Xixi Zhang

Publication date 10 February 2014

Full work available at URL https://arxiv.org/abs/1206.4393, http://www.math.technion.ac.il/iic/ela/ela-articles/articles/vol26_pp28-48.pdf

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

bipartitionLaplacian coefficientLaplacian matrixpermanenttreeunicyclic graph

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: The trees, respectively unicyclic graphs, on $n$ vertices with the smallest Laplacian permanent are studied. In this paper, by edge-grafting transformations, the $n$-vertex trees of given bipartition having the second and third smallest Laplacian permanent are identified. Similarly, the $n$-vertex bipartite unicyclic graphs of given bipartition having the first, second and third smallest Laplacian permanent are characterized. Consequently, the $n$-vertex bipartite unicyclic graphs with the first, second and third smallest Laplacian permanent are determined.

Recommendations

• Unicyclic graphs with the first seven smallest Laplacian permanent.
• 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 permanent of the Laplacian matrix of a bipartite graph
• Permanent of the Laplacian matrix of trees and bipartite graphs

Cited in

(11)

• On the (signless) Laplacian permanental polynomials of graphs
• Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
• The coefficients of the immanantal polynomial
• On the reformulated reciprocal sum-degree distance of graph transformations
• Some extremal properties of the multiplicatively weighted Harary index of a graph
• Further results on permanental bounds for the Laplacian matrix of trees
• On the extremal total reciprocal edge-eccentricity of trees
• Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
• Unicyclic graphs with the first seven smallest Laplacian permanent.
• Further results on permanents of Laplacian matrices of trees
• Sufficient conditions for L-leaf-connected graphs in terms of the inverse index, the reciprocal product-degree distance, and the multiplicative version of the first Zagreb index

This page was built for publication: Edge-grafting theorems on permanents of Laplacian matrices of graphs and their applications

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