On the permanental sum of bicyclic graphs

Tingzeng Wu, Kinkar Chandra Das

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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 languageEnglish
Article number72
JournalComputational and Applied Mathematics
Volume39
Issue number2
DOIs
StatePublished - 1 May 2020

Keywords

  • Bicyclic graph
  • Permanent
  • Permanental polynomial
  • Permanental sum

Fingerprint

Dive into the research topics of 'On the permanental sum of bicyclic graphs'. Together they form a unique fingerprint.

Cite this