The Uniqueness of DMAX-Matrix Graph Invariants

被引：15

作者：

Dehmer, Matthias ^{[1
]}

Shi, Yongtang ^{[2
,3
]}

机构：

[1] UMIT, Inst Bioinformat & Translat Res, Eduard Wallnoefer Zentrum 1, A-6060 Hall In Tirol, Austria

[2] Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China

[3] Nankai Univ, LPMC TJKLC, Tianjin 300071, Peoples R China

来源：

PLOS ONE | 2014年 / 9卷 / 01期

基金：

奥地利科学基金会; 美国国家科学基金会;

关键词：

INFORMATION; DISCRIMINATION; INDEXES;

D O I：

10.1371/journal.pone.0083868

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix D-MAX defined by Randic et al. In order to do so, we use exhaustively generated graphs instead of special graph classes such as trees only. Using these graph classes allow us to generalize the findings towards complex networks as they usually do not possess any structural constraints. We obtain that the uniqueness of this newly proposed graph invariant is approximately as low as the uniqueness of the Balaban J index on exhaustively generated (general) graphs.

引用

页数：3

共 16 条

[1]

[Anonymous], 2010, NAUTY

[2] NEW VERTEX INVARIANTS AND TOPOLOGICAL INDEXES OF CHEMICAL GRAPHS BASED ON INFORMATION ON DISTANCES [J].