| Publication | Date of Publication | Type |
|---|
| Relationships between symmetry-based graph measures | 2024-01-19 | Paper |
| On the relationship between PageRank and automorphisms of a graph | 2024-01-10 | Paper |
| Mathematical foundations of data science using R | 2022-10-24 | Paper |
| Szeged-like entropies of graphs | 2022-07-11 | Paper |
| On the zeros of the partial Hosoya polynomial of graphs | 2021-04-19 | Paper |
| On graph entropy measures based on the number of independent sets and matchings | 2021-03-31 | Paper |
| On the degeneracy of the Randić entropy and related graph measures | 2021-02-04 | Paper |
| Hermitian normalized Laplacian matrix for directed networks | 2020-12-10 | Paper |
| Graph measures with high discrimination power revisited: a random polynomial approach | 2020-09-22 | Paper |
| Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach | 2020-09-22 | Paper |
| Quantitative graph theory: a new branch of graph theory and network science | 2020-07-16 | Paper |
| Relations and bounds for the zeros of graph polynomials using vertex orbits | 2020-05-14 | Paper |
| The watching system as a generalization of identifying code | 2020-05-14 | Paper |
| A note on distance-based entropy of dendrimers | 2020-03-24 | Paper |
| A graph theoretic approach to construct desired cryptographic Boolean functions | 2020-03-23 | Paper |
| Mathematical foundations of data science using R | 2020-03-11 | Paper |
| Properties of graph distance measures by means of discrete inequalities | 2020-02-17 | Paper |
| Highly unique network descriptors based on the roots of the permanental polynomial | 2020-02-07 | Paper |
| Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs | 2020-01-09 | Paper |
| On efficient network similarity measures | 2020-01-09 | Paper |
| Hosoya entropy of fullerene graphs | 2019-11-27 | Paper |
| Graph distance measures based on topological indices revisited | 2019-03-15 | Paper |
| Fifty years of graph matching, network alignment and network comparison | 2018-10-30 | Paper |
| Comments to “Quantification of network structural dissimilarities” published by Schieber et al | 2018-10-09 | Paper |
| Probabilistic inequalities for evaluating structural network measures | 2017-02-08 | Paper |
| Influence of statistical estimators on the large-scale causal inference of regulatory networks | 2016-11-25 | Paper |
| Entropy of weighted graphs with Randić weights | 2016-06-15 | Paper |
| Entropy bounds for dendrimers | 2016-04-28 | Paper |
| A computational approach to construct a multivariate complete graph invariant | 2016-01-14 | Paper |
| Quantitative Graph Theory | 2014-10-06 | Paper |
| Universal construction mechanism for networks from one-dimensional symbol sequences | 2014-05-07 | Paper |
| An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants | 2013-08-27 | Paper |
| Evolutionary dynamics of the spatial prisoner's dilemma with self-inhibition | 2012-05-18 | Paper |
| A Brief Introduction to Complex Networks and Their Analysis | 2010-12-21 | Paper |
| Structural similarity of directed universal hierarchical graphs: a low computational complexity approach | 2010-09-01 | Paper |
| ROBUSTNESS IN SCALE-FREE NETWORKS: COMPARING DIRECTED AND UNDIRECTED NETWORKS | 2008-12-01 | Paper |
| NONLINEAR TIME SERIES PREDICTION BASED ON A POWER-LAW NOISE MODEL | 2008-11-03 | Paper |
| Structural information content of networks: graph entropy based on local vertex functionals | 2008-08-12 | Paper |
| A comparative analysis of multidimensional features of objects resembling sets of graphs | 2008-03-06 | Paper |
| Information theoretic measures of UHG graphs with low computational complexity | 2007-09-19 | Paper |
| Comparing large graphs efficiently by margins of feature vectors | 2007-07-10 | Paper |
| Topological mappings between graphs, trees and generalized trees | 2007-06-06 | Paper |
| A HETEROSYNAPTIC LEARNING RULE FOR NEURAL NETWORKS | 2007-03-20 | Paper |
| A similarity measure for graphs with low computational complexity | 2007-01-09 | Paper |
| STOCHASTIC SZNAJD MODEL IN OPEN COMMUNITY | 2006-01-31 | Paper |
