Quantitative graph theory: a new branch of graph theory and network science
From MaRDI portal
Publication:780939
DOI10.1016/j.ins.2017.08.009zbMath1443.05176arXiv1710.05660OpenAlexW2746612260MaRDI QIDQ780939
Matthias Dehmer, Yongtang Shi, Frank Emmert-Streib
Publication date: 16 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.05660
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph theory (05C99)
Related Items
Wiener polarity index of dendrimers ⋮ Bounds on the modified second Zagreb index ⋮ Graph-based semi-supervised one class support vector machine for detecting abnormal lung sounds ⋮ Unnamed Item ⋮ Some inequalities for general zeroth-order Randic index
Uses Software
Cites Work
- Entropy of weighted graphs with Randić weights
- A history of graph entropy measures
- Extremal subgraphs for two graphs
- The maximum edit distance from hereditary graph properties
- Inequalities for entropy-based measures of network information content
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
- GrInvIn in a nutshell
- The tree-to-tree editing problem
- Parallel concepts in graph theory
- Fifty years of graph matching, network alignment and network comparison
- On structure-sensitivity of degree-based topological indices
- Graph similarity scoring and matching
- Multivariate image similarity in the compressed domain using statistical graph matching
- On the eigenvalues of trees
- Graph Energy
- Structural Analysis of Complex Networks
- Graph minors. II. Algorithmic aspects of tree-width
- On a certain distance between isomorphism classes of graphs
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- Typology by Means of Language Networks: Applying Information Theoretic Measures to Morphological Derivation Networks
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item