No Detail Found!

On the permanental polynomial and permanental sum of signed graphs

Author(s)
Zikai Tang MOE-LCSM, School of Mathematics and Statistics, Hunan Normal University,Changsha, Hunan,P. R. China
Qiyue Li MOE-LCSM, School of Mathematics and Statistics, Hunan Normal University,Changsha, Hunan,P. R. China
Hanyuan Deng MOE-LCSM, School of Mathematics and Statistics, Hunan Normal University,Changsha, Hunan,P. R. China
Abstract
Let G_ = (G; ) be a signed graph, where G is its underlying graph and is its sign function (defined on the edge set E(G) of G). Let A(G_ ) be the adjacency matrix of G_ . The polynomial (G_ ; x) = per(xI A(G_ )) is called the permanental polynomial of G_ , where I is the identity matrix and per denotes the permanent of a matrix. In this paper, we obtain the coefficients of the permanental polynomial of a signed graph in terms of its structure. We also establish the recursion formulas for the permanental polynomial of a signed graph. Moreover, we investigate the permanental sum P S(G_ ) of a signed graph G_ , give the recursion formulas for the permanental sum P S(G_ ), and show that the equation P S(G_ ) = P S(G) holds for trees and unicyclic graphs, where P S(G) is the permanental sum of the underlying graph G of G_ .
Publication Details
Page(s) 14-20
Published Journal: Discrete Mathematics Letters, Volume: 10, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
Adjacency matrix, recursion formulas, permanental polynomial, permanental sum, coefficient
0

Citations

0

Downloads

61

Views