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

Note on the Distance Energy of Graphs

Burcu Bozkurt
TL;DR: In this article, the distance energy of a graph G is defined as the sum of the absolute values of the eigenvalues of the distance matrix of G. The distance matrix is defined to be defined as a function of the number of vertices and edges of G in the graph.
Journal ArticleDOI

Movement in museums: mediating between museum intent and visitor experience

Kali Tzortzi
- 24 Sep 2014 - 
TL;DR: In this article, the relation between observable patterns of visitor movement and museum intent, as expressed in the architectural layout of spaces and the curatorial arrangement of objects, is studied, and it is shown that the ways these museums structure movement paths are critical to how exhibits are perceived by visitors through spatial and visual relations.
Journal ArticleDOI

A matrix-based approach to searching colored paths in a weighted colored multidigraph

Haiyan Xu, +3 more
- 01 Sep 2009 - 
TL;DR: An algebraic approach to finding all edge-weighted-colored paths within a weighted colored multidigraph is developed, revealing the relationship between a coloredmultidigraph and a simple digraph, thereby providing new insights into algebraic graph theory.
Journal ArticleDOI

On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension

Sandi Klavÿzar, +1 more
- 01 Jan 2013 - 
TL;DR: In this paper, the distance between an arbitrary vertex and an almost-extreme vertex in Sierpinski graphs has been investigated, where an almost extreme vertex is defined as a vertex that is either adjacent to an extreme vertex of Sn p or is incident to an edge between two subgraphs of Snp-1.

On detour index

Bo Zhou, +1 more
TL;DR: The detour index of a connected graph is defined as the sum of the detour distances (lengths of longest paths) between unordered pairs of vertices of the graph as discussed by the authors.