scispace - formally typeset
Open AccessBook

Distance in graphs

Fred Buckley, +1 more
About: 
The article was published on 1990-01-01 and is currently open access. It has received 1185 citations till now. The article focuses on the topics: Graph theory & Convexity.

read more

Citations
More filters
Posted Content

Do logarithmic proximity measures outperform plain ones in graph clustering

Vladimir Ivashkin, +1 more
- 03 May 2016 - 
TL;DR: It turns out that in most cases, logarithmic measures perform better while distinguishing underlying classes than the “plain” measures, and some distances corresponding to the logarathmic measures possess a meaningful cutpoint additivity property.
Proceedings ArticleDOI

Using meta-level ontology relations to measure conceptual alignment and interoperability of simulation models

Levent Yilmaz
TL;DR: A graph-theoretic approach to measure the extent of conceptual congruity of models within a new context, based on having contextualized models that provide introspective access to their metamodels.
Journal Article

The Structurally Dynamic Cellular Network and Quantum Graphity Approaches to Quantum Gravity and Quantum Geometry - A Review and Comparison

Manfred Requardt, +1 more
- 02 Jan 2015 - 
TL;DR: In this article, a structural dynamic cellular network (SDCN) model is proposed for quantum geometry, which is based on a geometric renormalization group which creates a kind of sparse translocal network of correlations between the points in classical continuous space-time and underlies, in their view, such mysterious phenomena as holography and the black hole entropy-area law.
Journal ArticleDOI

Constructing new families of transmission irregular graphs

Kexiang Xu, +3 more
- 31 Jan 2021 - 
TL;DR: In this paper, it was shown that the line graph of T (a, a + 1, a+ 1, a + 2 ), a ≥ 2, is transmission irregular if and only if a is even.

Wiener index of generalized 4-stars and of their quadratic line graphs.

Martin Knor, +1 more
TL;DR: Several infinite families of trees are constructed which have a unique branching vertex of degree 4 and whose Wiener index equals theWiener index of their quadratic line graph.