Steiner intervals, geodesic intervals, and betweenness
نویسندگان
چکیده
∗Work supported by the Ministry of Science of Slovenia and by the Ministry of Science and Technology of India under the bilateral India-Slovenia grants BI-IN/06-07-002 and DST/INT/SLOV-P03/05, respectively. †Authors are also with the Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia.
منابع مشابه
A note on 3-Steiner intervals and betweenness
The geodesic and geodesic interval, namely the set of all vertices lying on geodesics between a pair of vertices in a connected graph, is a part of folklore in metric graph theory. It is also known that Steiner tree of a (multi) set with k (k > 2) vertices, generalizes geodesics. In [1] the authors studied the k-Steiner intervals S(u1, u2, . . . , uk) on connected graphs (k ≥ 3) as the k-ary ge...
متن کاملThe induced path convexity, betweenness, and svelte graphs
The induced path interval J (u; v) consists of the vertices on the induced paths between u and v in a connected graph G. Di-erences in properties with the geodesic interval are studied. Those graphs are characterized, in which the induced path intervals de/ne a proper betweenness. The intersection of the induced path intervals between the pairs of a triple, in general, consists of a big chunk o...
متن کاملGraphs with 4-steiner Convex Balls
Recently a new graph convexity was introduced, arising from Steiner intervals in graphs that are a natural generalization of geodesic intervals. The Steiner tree of a set W on k vertices in a connected graph G is a tree with the smallest number of edges in G that contains all vertices of W . The Steiner interval I(W ) of W consists of all vertices in G that lie on some Steiner tree with respect...
متن کاملConvex Sets in Lexicographic Products of Graphs
Geodesic convex sets, Steiner convex sets, and J-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies [4, Theorem 3.1].
متن کاملThe Power of Quasi-Shortest Paths: ρ-Geodesic Betweenness Centrality
Betweenness centrality metrics usually underestimate the importance of nodes that are close to shortest paths but do not exactly fall on them. In this paper, we reevaluate the importance of such nodes and propose the ρ-geodesic betweenness centrality, a novel metric that assigns weights to paths (and, consequently, to nodes on these paths) according to how close they are to shortest paths. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009