| Publication | Date of Publication | Type |
|---|
| Fullerenes via their counting polynomials | 2024-04-16 | Paper |
| Relationships between symmetry-based graph measures | 2024-01-19 | Paper |
| On the relationship between PageRank and automorphisms of a graph | 2024-01-10 | Paper |
| List injective coloring of planar graphs | 2023-05-31 | Paper |
| Szeged and Mostar root-indices of graphs | 2023-04-21 | Paper |
| Mathematical foundations of data science using R | 2022-10-24 | Paper |
| Novel results on partial Hosoya polynomials: an application in chemistry | 2022-08-05 | Paper |
| Szeged-like entropies of graphs | 2022-07-11 | Paper |
| Flexible modeling of parafoil delivery system in wind environments | 2022-02-16 | Paper |
| New results of identifying codes in product graphs | 2021-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5157506 | 2021-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4956501 | 2021-09-02 | Paper |
| On conjectures of network distance measures by using graph spectra | 2021-08-02 | Paper |
| An extension of the reorder point method by using advance demand spike information | 2021-04-20 | 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 |
| A new coupled disease-awareness spreading model with mass media on multiplex networks | 2020-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116097 | 2020-08-21 | 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 |
| Modeling and control of parafoils based on computational fluid dynamics | 2020-04-06 | 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 |
| Computational fluid dynamics based dynamic modeling of parafoil system | 2020-02-12 | Paper |
| A comparative analysis of new graph distance measures and graph edit distance | 2020-02-07 | Paper |
| Highly unique network descriptors based on the roots of the permanental polynomial | 2020-02-07 | Paper |
| On efficient network similarity measures | 2020-01-09 | Paper |
| Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs | 2020-01-09 | Paper |
| Hosoya entropy of fullerene graphs | 2019-11-27 | Paper |
| Nordhaus-Gaddum type results for graph irregularities | 2019-11-22 | Paper |
| A hybrid binomial inverse hypergeometric probability distribution: theory and applications | 2019-11-15 | Paper |
| Graph operations based on using distance-based graph entropies | 2019-11-13 | Paper |
| A calculus for measuring the elegance of abstract graphs | 2019-06-21 | Paper |
| A note on distance-based graph entropies | 2019-05-27 | Paper |
| Network entropies based on independent sets and matchings | 2019-03-29 | Paper |
| Identifying anticancer peptides by using a generalized chaos game representation | 2019-03-29 | Paper |
| Principal minor version of matrix-tree theorem for mixed graphs | 2019-03-29 | Paper |
| On the distance based graph entropies | 2019-03-19 | Paper |
| Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix | 2019-03-18 | Paper |
| Graph distance measures based on topological indices revisited | 2019-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4561594 | 2018-12-12 | Paper |
| New inequalities for network distance measures by using graph spectra | 2018-12-10 | 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 |
| Bounds for degree-based network entropies | 2018-08-24 | Paper |
| Degree-based entropies of networks revisited | 2018-06-19 | Paper |
| A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees | 2018-06-07 | Paper |
| Novel inequalities for generalized graph entropies -- graph energies and topological indices | 2018-06-07 | Paper |
| Time-Based Estimation of Vulnerable Points in the Munich Subway Network | 2017-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5279993 | 2017-07-19 | Paper |
| Information theory of networks | 2017-05-12 | Paper |
| Probabilistic inequalities for evaluating structural network measures | 2017-02-08 | Paper |
| Extremality of degree-based graph entropies | 2017-02-02 | Paper |
| Graph Polynomials | 2016-11-07 | Paper |
| Entropy of weighted graphs with Randić weights | 2016-06-15 | Paper |
| The Hosoya entropy of a graph | 2016-06-15 | Paper |
| A network-based feature selection approach to identify metabolic signatures in disease | 2016-06-09 | Paper |
| Entropy bounds for dendrimers | 2016-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3464847 | 2016-01-27 | Paper |
| A computational approach to construct a multivariate complete graph invariant | 2016-01-14 | Paper |
| Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial | 2016-01-04 | Paper |
| Large-scale analysis of structural branching measures | 2014-10-09 | Paper |
| Quantitative Graph Theory | 2014-10-06 | Paper |
| Entropy and the complexity of graphs revisited | 2014-09-08 | Paper |
| A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS | 2014-06-25 | Paper |
| On structure-sensitivity of degree-based topological indices | 2014-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5408327 | 2014-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403959 | 2014-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2856764 | 2013-10-30 | Paper |
| An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants | 2013-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2895943 | 2012-07-13 | Paper |
| Bounds on the moduli of polynomial zeros | 2012-06-13 | Paper |
| A history of graph entropy measures | 2011-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3587560 | 2010-09-08 | Paper |
| Structural similarity of directed universal hierarchical graphs: a low computational complexity approach | 2010-09-01 | Paper |
| Inequalities for entropy-based measures of network information content | 2010-03-31 | Paper |
| CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES | 2009-08-26 | 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 |
| Information processing in complex networks: Graph entropy and information functionals | 2008-09-12 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5445046 | 2008-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5433670 | 2008-01-09 | 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 similarity measure for graphs with low computational complexity | 2007-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517050 | 2000-11-21 | Paper |
