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

preprint2012arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.