Highly unique network descriptors based on the roots of the permanental polynomial

Matthias Dehmer, Frank Emmert-Streib, Bo Hu, Yongtang Shi, Monica Stefu, Shailesh Tripathi

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)176-181
Number of pages6
JournalInformation Sciences
Volume408
DOIs
Publication statusPublished - 1 Oct 2017
Externally publishedYes

Keywords

  • Data science
  • Graphs
  • Networks
  • Quantitative graph theory
  • Statistics

Fingerprint Dive into the research topics of 'Highly unique network descriptors based on the roots of the permanental polynomial'. Together they form a unique fingerprint.

Cite this