Abstract
Let A(G) be the adjacency matrix of a graph G. The permanental polynomial of G is defined as π(G, x) = per (xI- A(G)). The permanental sum of G can be defined as the sum of the absolute values of the coefficients of π(G, x). In this paper, we investigate the properties of the permanental sum of bicyclic graphs. We present upper and lower bounds of the permanental sum of bicyclic graphs, and the corresponding extremal bicyclic graphs are also determined.
| Original language | English |
|---|---|
| Article number | 72 |
| Journal | Computational and Applied Mathematics |
| Volume | 39 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 May 2020 |
Keywords
- Bicyclic graph
- Permanent
- Permanental polynomial
- Permanental sum