TY - JOUR
T1 - Highly unique network descriptors based on the roots of the permanental polynomial
AU - Dehmer, Matthias
AU - Emmert-Streib, Frank
AU - Hu, Bo
AU - Shi, Yongtang
AU - Stefu, Monica
AU - Tripathi, Shailesh
PY - 2017/10/1
Y1 - 2017/10/1
N2 - 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.
AB - 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.
KW - Data science
KW - Graphs
KW - Networks
KW - Quantitative graph theory
KW - Statistics
UR - http://www.scopus.com/inward/record.url?scp=85018769218&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2017.04.041
DO - 10.1016/j.ins.2017.04.041
M3 - Article
AN - SCOPUS:85018769218
SN - 0020-0255
VL - 408
SP - 176
EP - 181
JO - Information Sciences
JF - Information Sciences
ER -