Generalized Permanental Polynomials of Graphs
School of Science, Chang’an University, Xi’an 710064, China
Received: 28 January 2019 / Accepted: 14 February 2019 / Published: 16 February 2019
PDF [761 KB, uploaded 16 February 2019]
The search for complete graph invariants is an important problem in graph theory and computer science. Two networks with a different structure can be distinguished from each other by complete graph invariants. In order to find a complete graph invariant, we introduce the generalized permanental polynomials of graphs. Let G
be a graph with adjacency matrix
and degree matrix
. The generalized permanental polynomial of G
is defined by
. In this paper, we compute the generalized permanental polynomials for all graphs on at most 10 vertices, and we count the numbers of such graphs for which there is another graph with the same generalized permanental polynomial. The present data show that the generalized permanental polynomial is quite efficient for distinguishing graphs. Furthermore, we can write
in the coefficient form
and obtain the combinatorial expressions for the first five coefficients
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Liu, S. Generalized Permanental Polynomials of Graphs. Symmetry 2019, 11, 242.
Liu S. Generalized Permanental Polynomials of Graphs. Symmetry. 2019; 11(2):242.
Liu, Shunyi. 2019. "Generalized Permanental Polynomials of Graphs." Symmetry 11, no. 2: 242.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.