Add to ORKGIn this paper, we evaluate the discrimination power of structural superindices. Superindices for graphs represent measures composed of other structural indices. In particular, we compare the discrimination power of the superindices with those of individual graph descriptors. In addition, we perform a statistical analysis to generalize our findings to large graphs
Irregularity indices are generally used for quantitative characterization of topological structure o...
INTRODUCTION Substructures and subgraphs of chemical structures are becoming increasingly important...
Based on a large dataset containing thousands of real-world networks ranging from genetic, protein i...
In this paper, we evaluate the discrimination power of structural superindices. Superindices for gra...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
In this paper, we study the discrimination power of graph measures that are based on graph-theoretic...
<p>To calculate the superindex, we used all combinations of eigenvalue-based and distance-based desc...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
In this paper, we study the discrimination power of graph measures that are based on graph-theoretic...
A highly discriminating topological index, EAID, is generated in our laboratory. A systematic search...
Traditional indices in relational databases are designed for queries that are selective by value. Ho...
In this paper, we evaluate the uniqueness of several information-theoretic measures for graphs based...
Quantitative graph analysis by using structural indices has been intricate in a sense that it often ...
Irregularity indices are generally used for quantitative characterization of topological structure o...
INTRODUCTION Substructures and subgraphs of chemical structures are becoming increasingly important...
Based on a large dataset containing thousands of real-world networks ranging from genetic, protein i...
In this paper, we evaluate the discrimination power of structural superindices. Superindices for gra...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
In this paper, we study the discrimination power of graph measures that are based on graph-theoretic...
<p>To calculate the superindex, we used all combinations of eigenvalue-based and distance-based desc...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
In this paper, we study the discrimination power of graph measures that are based on graph-theoretic...
A highly discriminating topological index, EAID, is generated in our laboratory. A systematic search...
Traditional indices in relational databases are designed for queries that are selective by value. Ho...
In this paper, we evaluate the uniqueness of several information-theoretic measures for graphs based...
Quantitative graph analysis by using structural indices has been intricate in a sense that it often ...
Irregularity indices are generally used for quantitative characterization of topological structure o...
INTRODUCTION Substructures and subgraphs of chemical structures are becoming increasingly important...
Based on a large dataset containing thousands of real-world networks ranging from genetic, protein i...