Some Extremal Graphs with Respect to Permanental Sum

Autor:	Shengzhang Ren, Tingzeng Wu, Kinkar Chandra Das
Rok vydání:	2018
Předmět:	010101 applied mathematics Combinatorics Hexagonal crystal system General Mathematics 010102 general mathematics Bipartite graph Adjacency matrix 0101 mathematics 01 natural sciences Upper and lower bounds Graph Mathematics
Zdroj:	Bulletin of the Malaysian Mathematical Sciences Society. 42:2947-2961
ISSN:	2180-4206 0126-6705
DOI:	10.1007/s40840-018-0642-9
Popis:	Let G be a graph and A(G) the adjacency matrix of G. The polynomial $$\pi (G,x)=\mathrm {per}(xI-A(G))$$ is called the permanental polynomial of G, and the permanental sum of G is the summation of the absolute values of the coefficients of $$\pi (G,x)$$ . In this paper, we give some upper and lower bounds for the permanental sum among spiro hexagonal chains, and the corresponding extremal graphs are determined. Furthermore, we investigate the more general result about permanental sum. We obtain a lower bound for the permanental sum of bipartite graphs and the corresponding extremal graphs are also determined.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e7894d9b820a2748312b971e56cdfd9e https://doi.org/10.1007/s40840-018-0642-9 Zobrazit plný text záznamu Full text from SpringerLink