Finite Sholander trees, trees, and their betweenness
نویسندگان
چکیده
منابع مشابه
Finite Sholander Trees, Trees, and their Betweennesses
We provide a proof of a claim made by Sholander (Trees, lattices, order, and betweenness, Proc. Amer. Math. Soc. 3, 369-381 (1952)) concerning the representability of collections of so-called segments by trees. Furthermore, we strengthen Burigana’s axiomatic characterization of so-called betweennesses induced by trees (Tree representations of betweenness relations defined by intersection and in...
متن کاملBetweenness centrality profiles in trees
Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in a network. The kbetweenness centrality of a vertex is defined similarly, but only considers shortest paths of length at most k. The sequence of k-betweenness centralities for all possible values of k forms the betwee...
متن کاملLinguistics, Logic and Finite Trees
A modal logic is developed to deal with nite ordered binary trees as they are used in computational linguistics A modal language is intro duced with operators for the mother of rst daughter of and second daughter of relations together with their transitive re exive closures The relevant class of tree models is de ned and three linguistic applications of this language are discussed context free ...
متن کاملOn the distribution of betweenness centrality in random trees
Betweenness centrality is a quantity that is frequently used to measure how ‘central’ a vertex v is. It is defined as the sum, over pairs of vertices other than v, of the proportions of shortest paths that pass through v. In this paper, we study the distribution of the betweenness centrality in random trees and related, subcritical graph families. Specifically, we prove that the betweenness cen...
متن کاملBijections for Cayley trees, spanning trees, and their q-analogues
We construct a family of extremely simple bijections that yield Cayley’s famous formula for counting trees. The weight preserving properties of these bijections furnish a number of multivariate generating functions for weighted Cayley trees. Essentially the same idea is used to derive bijective proofs and q-analogues for the number of spanning trees of other graphs, including the complete bipar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.06.011