Quantitative graph theory: a new branch of graph theory and network science
From MaRDI portal
(Redirected from Publication:780939)
Abstract: In this paper, we describe {sc quantitative graph theory} and argue it is a new graph-theoretical branch in network science, however, with significant different features compared to classical graph theory. The main goal of quantitative graph theory is the structural quantification of information contained in complex networks by employing a {it measurement approach} based on numerical invariants and comparisons. Furthermore, the methods as well as the networks do not need to be deterministic but can be statistic. As such this complements the field of classical graph theory, which is descriptive and deterministic in nature. We provide examples of how quantitative graph theory can be used for novel applications in the context of the overarching concept network science.
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 4089609 (Why is no real title available?)
- scientific article; zbMATH DE number 3781232 (Why is no real title available?)
- scientific article; zbMATH DE number 3781233 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 5259316 (Why is no real title available?)
- scientific article; zbMATH DE number 5037209 (Why is no real title available?)
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- A history of graph entropy measures
- A new method of measuring similarity for a special class of directed graphs
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy of weighted graphs with Randić weights
- Extremal subgraphs for two graphs
- Fifty years of graph matching, network alignment and network comparison
- GrInvIn in a nutshell
- Graph energy
- Graph minors. II. Algorithmic aspects of tree-width
- Graph similarity scoring and matching
- Graph-theoretical matrices in chemistry
- Inequalities for entropy-based measures of network information content
- Multivariate image similarity in the compressed domain using statistical graph matching
- Note on the HOMO-LUMO index of graphs
- On a certain distance between isomorphism classes of graphs
- On structure-sensitivity of degree-based topological indices
- On the eigenvalues of trees
- Parallel concepts in graph theory
- Random graphs.
- Structural Analysis of Complex Networks
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
- The maximum edit distance from hereditary graph properties
- The tree-to-tree editing problem
- Typology by means of language networks: applying information theoretic measures to morphological derivation networks
Cited in
(8)- Some applications of graph theory in networks research
- Quo vadis, graph theory? A source book for challenges and directions
- Quantitative graph theory. Mathematical foundations and applications
- Bounds on the modified second Zagreb index
- Some inequalities for general sum-connectivity index
- Some inequalities for general zeroth-order Randic index
- Graph-based semi-supervised one class support vector machine for detecting abnormal lung sounds
- Wiener polarity index of dendrimers
This page was built for publication: Quantitative graph theory: a new branch of graph theory and network science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780939)
