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

Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

11 Zitate (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.

OriginalspracheEnglisch
Seiten (von - bis)176-181
Seitenumfang6
FachzeitschriftInformation Sciences
Jahrgang408
DOIs
PublikationsstatusVeröffentlicht - 1 Okt 2017
Extern publiziertJa

Fingerprint

Untersuchen Sie die Forschungsthemen von „Highly unique network descriptors based on the roots of the permanental polynomial“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren