Graph measures with high discrimination power revisited: A random polynomial approach

Matthias Dehmer, Zengqiang Chen, Frank Emmert-Streib, Yongtang Shi, Shailesh Tripathi

Publikation: Beitrag in FachzeitschriftArtikel

5 Zitate (Scopus)

Abstract

Finding graph measures with high discrimination power has been triggered by searching for so-called complete graph invariants. In a series of papers, we have already investigated highly discriminating measures to distinguish graphs (networks) based on their topology. In this paper, we propose an approach where the graph measures are based on the roots of random graph polynomials. The polynomial coefficients have been defined by utilizing information functionals which capture structural information of the underlying networks. Our numerical results obtained by employing exhaustively generated graphs reveal that the new approach outperforms earlier results in the literature.

OriginalspracheEnglisch
Seiten (von - bis)407-414
Seitenumfang8
FachzeitschriftInformation Science
Jahrgang467
DOIs
PublikationsstatusVeröffentlicht - Okt 2018

Fingerprint

Untersuchen Sie die Forschungsthemen von „Graph measures with high discrimination power revisited: A random polynomial approach“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren