The Extremal Permanental Sum for a Quasi-Tree Graph
Let G be a graph and A(G) the adjacency matrix of G. The permanent of matrix (xI-A(G)) is called the permanental polynomial of G. The permanental sum of G is the sum of the absolute values of the coefficients of permanental polynomial of G. Computing the permanental sum is #p-complete. In this note,...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2019-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2019/4387650 |
| id |
doaj-63bc16f3b0504989a0559f4013eba4e5 |
|---|---|
| record_format |
Article |
| spelling |
doaj-63bc16f3b0504989a0559f4013eba4e52020-11-25T00:52:58ZengHindawi-WileyComplexity1076-27871099-05262019-01-01201910.1155/2019/43876504387650The Extremal Permanental Sum for a Quasi-Tree GraphTingzeng Wu0Huazhong Lü1School of Mathematics and Statistics, Qinghai Nationalities University, Xining, Qinghai 810007, ChinaSchool of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan 610054, ChinaLet G be a graph and A(G) the adjacency matrix of G. The permanent of matrix (xI-A(G)) is called the permanental polynomial of G. The permanental sum of G is the sum of the absolute values of the coefficients of permanental polynomial of G. Computing the permanental sum is #p-complete. In this note, we prove the maximum value and the minimum value of permanental sum of quasi-tree graphs. And the corresponding extremal graphs are also determined. Furthermore,we also determine the graphs with the minimum permanental sum among quasi-tree graphs of order n and size m, where n-1≤m≤2n-3.http://dx.doi.org/10.1155/2019/4387650 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Tingzeng Wu Huazhong Lü |
| spellingShingle |
Tingzeng Wu Huazhong Lü The Extremal Permanental Sum for a Quasi-Tree Graph Complexity |
| author_facet |
Tingzeng Wu Huazhong Lü |
| author_sort |
Tingzeng Wu |
| title |
The Extremal Permanental Sum for a Quasi-Tree Graph |
| title_short |
The Extremal Permanental Sum for a Quasi-Tree Graph |
| title_full |
The Extremal Permanental Sum for a Quasi-Tree Graph |
| title_fullStr |
The Extremal Permanental Sum for a Quasi-Tree Graph |
| title_full_unstemmed |
The Extremal Permanental Sum for a Quasi-Tree Graph |
| title_sort |
extremal permanental sum for a quasi-tree graph |
| publisher |
Hindawi-Wiley |
| series |
Complexity |
| issn |
1076-2787 1099-0526 |
| publishDate |
2019-01-01 |
| description |
Let G be a graph and A(G) the adjacency matrix of G. The permanent of matrix (xI-A(G)) is called the permanental polynomial of G. The permanental sum of G is the sum of the absolute values of the coefficients of permanental polynomial of G. Computing the permanental sum is #p-complete. In this note, we prove the maximum value and the minimum value of permanental sum of quasi-tree graphs. And the corresponding extremal graphs are also determined. Furthermore,we also determine the graphs with the minimum permanental sum among quasi-tree graphs of order n and size m, where n-1≤m≤2n-3. |
| url |
http://dx.doi.org/10.1155/2019/4387650 |
| work_keys_str_mv |
AT tingzengwu theextremalpermanentalsumforaquasitreegraph AT huazhonglu theextremalpermanentalsumforaquasitreegraph AT tingzengwu extremalpermanentalsumforaquasitreegraph AT huazhonglu extremalpermanentalsumforaquasitreegraph |
| _version_ |
1725239933972512768 |