Highly unique network descriptors based on the roots of the permanental polynomial
Research output: Contribution to journal › Article › Scientific › peer-review
|Number of pages||6|
|Publication status||Published - 1 Oct 2017|
|Publication type||A1 Journal article-refereed|
In this paper, we examine the zeros of permanental polynomials as highly unique network descriptors. We employ exhaustively generated networks and demonstrate that our defined graph measures based on the moduli of the zeros of permanental polynomials are quite efficient when distinguishing graphs structurally. In this work, we continue with a line of research that relates to the search of almost complete graph invariants. These highly unique network measures may serve as a powerful tool for tackling graph isomorphism.
ASJC Scopus subject areas
- Data science, Graphs, Networks, Quantitative graph theory, Statistics