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

doi:10.1016/j.ins.2017.04.041

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

^*Corresponding author for this work

Research output: Contribution to journal › Article › Scientific › peer-review

14 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 language	English
Pages (from-to)	176-181
Number of pages	6
Journal	Information Sciences
Volume	408
DOIs	https://doi.org/10.1016/j.ins.2017.04.041
Publication status	Published - 1 Oct 2017
Publication type	A1 Journal article-refereed

Keywords

Data science
Graphs
Networks
Quantitative graph theory
Statistics

Publication forum classification

Publication forum level 1

ASJC Scopus subject areas

Control and Systems Engineering
Theoretical Computer Science
Software
Computer Science Applications
Information Systems and Management
Artificial Intelligence

Access to Document

10.1016/j.ins.2017.04.041

Cite this

@article{60b5a181fa4e4f5d94e2f04ac0c72c10,

title = "Highly unique network descriptors based on the roots of the permanental polynomial",

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.",

keywords = "Data science, Graphs, Networks, Quantitative graph theory, Statistics",

author = "Matthias Dehmer and Frank Emmert-Streib and Bo Hu and Yongtang Shi and Monica Stefu and Shailesh Tripathi",

year = "2017",

month = oct,

day = "1",

doi = "10.1016/j.ins.2017.04.041",

language = "English",

volume = "408",

pages = "176--181",

journal = "Information Sciences",

issn = "0020-0255",

publisher = "Elsevier",

}

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

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 -

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

Abstract

Keywords

Publication forum classification

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this