Large-scale analysis of structural branching measures
From MaRDI portal
Publication:460865
DOI10.1007/S10910-013-0294-9zbMATH Open1296.92246OpenAlexW2042985698MaRDI QIDQ460865FDOQ460865
Authors: Michael Schutte, Matthias Dehmer 
Publication date: 9 October 2014
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-013-0294-9
Recommendations
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
- Towards structural network analysis.
- Large deviation theorem for branches of the random binary tree in the Horton-Strahler analysis
- Structural properties of the scale-free Barabasi-Albert graph
- scientific article; zbMATH DE number 168171
Cites Work
- Title not available (Why is that?)
- Series expansion of the directed percolation probability
- Notes on trees with minimal atom-bond connectivity index
- Title not available (Why is that?)
- Information processing in complex networks: Graph entropy and information functionals
- Augmented Zagreb index
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Social ontologies as generalized nearly acyclic directed graphs: a quantitative graph model of social tagging
- Probabilistic inequalities for evaluating structural network measures
- Complexity in chemistry, biology and ecology.
- Constant Time Generation of Rooted Trees
- Constant Time Generation of Free Trees
- Branching in graphs and molecules
- A comparative analysis of multidimensional features of objects resembling sets of graphs
- Information theory of networks
- On sphere-regular graphs and the extremality of information-theoretic network measures
Cited In (5)
- Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
- Comparing and distinguishing the structure of biological branching
- Novel results on partial Hosoya polynomials: an application in chemistry
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
Uses Software
This page was built for publication: Large-scale analysis of structural branching measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460865)
