In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix defined by Randić 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 index on exhaustively generated (general) graphs.
Citation: Dehmer M, Shi Y (2014) The Uniqueness of -Matrix Graph Invariants. PLoS ONE 9(1): e83868. https://doi.org/10.1371/journal.pone.0083868
Editor: Frank Emmert-Streib, Queen's University Belfast, United Kingdom
Received: September 24, 2013; Accepted: November 9, 2013; Published: January 2, 2014
Copyright: © 2014 Dehmer, Shi. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: Matthias Dehmer thanks the Austrian Science Funds for supporting this work (project P22029-N13). Yongtang Shi has been supported by the National Science Foundation of China. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
Matrix-based descriptors have been developed extensively –. As a result, the distance matrix, the adjacency matrix and other graph-theoretical matrices  have been used to define topological graph measures and to examine their properties , . A property which has been of considerable interest when designing topological descriptors is referred to as uniqueness –. Generally, the uniqueness of a structural graph measure relates to the ability to distinguish the structure of non-isomorphic graphs uniquely. From a mathematical point of view, the low uniqueness or high degeneracy of a graph measure under consideration is an undesired aspect as non-isomorphic graphs should be mapped to non-equal values. Such a highly discriminating graph invariant could be then used to distinguish graph structures uniquely and, thus, to perform graph isomorphism testing , . In the context of graph isomorphism testing, so-called complete graph invariants have been investigated , . Such a graph invariant has the property that it discriminates all non-isomorphic graphs uniquely (i.e., without any degeneracy) and isomorphic graphs are mapped to equal values , . For example, Liu and Klein  made an attempt to derive complete graph invariants by using eigenvalues. Dehmer et al. ,  defined graph entropies which turned out to be the most discriminative measures so far when using exhaustively generated graphs. Clearly, such measures are suitable candidates to test graph isomorphism efficiently .
Recently, Randić et al. ,  defined so-called matrices and also topological descriptors thereof. Let be a finite graph. Then these matrices have been defined by using the ordinary distance matrix of such that in each row and column the dominant (largest) distances are used where other elements are set to be zero, see , . Moreover they defined a new topological index which has the same definition than the well-known Balaban index  but uses instead of only using . Then based on example claculations, Randić et al.  argued that may be a promising candidate for isomorphism testing, but they did not examine the problem in depth on wider classes of graphs.
In this paper, we explore the uniqueness of by employing on a large scale. For this, we use exhaustively generated graphs with 9 and 10 vertices each  and alkane trees where . Our findings (see section 'Methods and Results') reveal that the uniqueness of is always worse than the one of and, thus, the uniqueness of is insufficient for performing isomorphism testing.
Methods and Results
The Structural Descriptors and
Let be a finite graph. To define the Balaban index ,  of , let be the distance matrix. is the topological distance between and . For each vertex , denotes the distance sum (row or column sum) by adding the entries in the corresponding row or column of . Let be the cyclomatic number . Then has been defined by  (1)
A critical analysis to examine the uniqueness of and other quantities has recently been carried out by Dehmer et al.  based on using exhaustively generated (general) graphs. In this sense Dehmer et al. examined the limitations of the Balaban index and found that this index is quite unstable ; here that means there is a strong dependency between the sample size of the graph set and the uniqueness . To study the technical details and the precise definitions, we refer to , . Moreover, the findings of Dehmer et al.  revealed that the uniqueness of by using exhaustively generated graphs is poor. For example by using the class (all non-isomorphic graphs with 10 vertices), , the Balaban index could only discriminate 20% of uniquely. Nevertheless, has high uniqueness for alkane trees and isomers , , .
To define , we require the definition of :
Following Randić et al., the topological index is just the analog to Balaban's index, see . Based on the fact that can discriminate the remaining isomers of -dodecane and has often a different structure compared to , Randić et al. concluded that and, hence, may be a promising tool for graph isomorphism testing, see . In the next section, we see that this statement has been too premature when evaluating on general and exhaustively generated graphs. By evaluating characteristic properties (e.g., the uniqueness) of topological graph measures on such (general) graphs, one can conclude how would the index behave in the context of using complex networks.
Before interpreting Table 1, we explain its notation. We here used the graph classes ,  and , . Again is the class of all exhaustively generated non-isomorphic and connected graphs with vertices . is the class of exhaustively generated non-isomorphic and connected alkane trees . ndv stands for the number of non-distinguishable values  and where is a class of graphs, see .
Table 1 shows numerical results when comparing and on the just explained graph classes. We observe that the uniqueness of is quite poor for all graph classes. In case of using , the uniqueness of is approximately as low as the uniqueness of . That means both topological indices can only discriminate about 39% out of 261080 graphs. By considering the results for , we see that possesses high uniqueness when using . Note that this has already been found by Balaban  and Dehmer et al. . But it is surprising that the uniqueness of is, without exception, much worse than the one of . Table 2 shows that can discriminate the isomers of -dodecane for which the Balaban index is pairwisely degenerated.
A hypothesis is that the sparseness of leads to this effect described above. So this matrix can not capture the complexity of the used graphs meaningfully and, thus, is degenerated for most of the graphs. This result shows the complexity of the problem to construct highly unique graph measures on general and exhaustively generated graphs.
Summary and Conclusion
This paper investigated the uniqueness of the recently developed topological index introduced by Randić et al. . has been defined quite similarly as it is based on the novel matrix instead of . Based on small tests and by only using example graphs, Randić et al.  hypothesized has higher uniqueness than and, the index which combined with index , may suffice to resolve the graph isomorphism issue for most cases of molecular graphs.
In this paper we have evaluated this hypothesis on a large scale by using general graphs. In fact, our study disproved this conjecture and demonstrated that the uniqueness of is quite poor by using general exhaustively generated graphs and alkane trees. As future work, we plan to determine so-called degeneracy classes analytically for performing a proper mathematical treatment of the problem. In any way, the search for highly discriminating graph invariants should be continued , , , . Following Randić et al. , such measures could be used as a prescreening method and would eliminate need for detailed and elaborate tests on large number of cases. Also, this fact has already been raised by Dehmer et al.  where they developed information-theoretic network measures with very low degeneracy on exhaustively generated graphs for graph isomorphism testing.
We thank Shailesh Tripathi for help and fruitful discussions. We also thank the 'Zentraler Informatikdienst' of the Technical University of Vienna for providing computing resources to perform large scale computations.
- 1. Devillers J, Balaban AT (1999) Topological Indices and Related Descriptors in QSAR and QSPR. Gordon and Breach Science Publishers. Amsterdam, The Netherlands.
- 2. Randić M, Orel R, Balaban AT (2013) dMAX matrix graph invariants as graph descriptors. graphs having the same balaban j index. MATCH Commun Math Comput Chem 70: 221–238.
- 3. Todeschini R, Consonni V, Mannhold R (2002) Handbook of Molecular Descriptors. Wiley-VCH. Weinheim, Germany.
- 4. Janežić D, Miležević A, Nikolić S, Trinajstić N (2007) Graph-Theoretical Matrices in Chemistry. Mathematical Chemistry Monographs. University of Kragujevac and Faculty of Science Kragujevac.
- 5. Dehmer M, Sivakumar L, Varmuza K (2012) Uniquely discriminating molecular structures using novel eigenvalue-based descriptors. MATCH Communications in Mathematical and in Computer Chemistry 67: 147–172.
- 6. Bonchev D, Mekenyan O, Trinajstić N (1981) Isomer discrimination by topological information approach. J Comp Chem 2: 127–148.
- 7. Konstantinova EV (1996) The discrimination ability of some topological and information distance indices for graphs of unbranched hexagonal systems. J Chem Inf Comput Sci 36: 54–57.
- 8. Dehmer M, Grabner M, Varmuza K (2012) Information indices with high discriminative power for graphs. PLoS ONE 7: e31214.
- 9. Dehmer M, Grabner M, Mowshowitz A, Emmert-Streib F (2012) An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants. Advances in Computational Mathematics.
- 10. McKay BD (2010). Nauty. http://cs.anu.edu.au/~bdm/nauty/.
- 11. Liu X, Klein DJ (1991) The graph isomorphism problem. Journal of Computational Chemistry 12: 1243–1251.
- 12. Randić M (2013) dMAX matrix of dominant distances in a graph. MATCH Commun Math Comput Chem 70: 239–258.
- 13. Balaban AT (1982) Highly discriminating distance-based topological index. Chem Phys Lett 89: 399–404.
- 14. Balaban AT, Balaban TS (1991) New vertex invariants and topological indices of chemical graphs based on information on distances. J Math Chem 8: 383–397.
- 15. Diudea MV, Ilić A, Varmuza K, Dehmer M (2011) Network analysis using a novel highly discriminating topological index. Complexity 16: 32–39.
- 16. Xu CYHL (1996) On highly discriminating molecular topological index. J Chem Inf Comput Sci 36: 82–90.