On transit functions in weighted graphs
From MaRDI portal
Publication:5367530
DOI10.1142/S1793830917500367zbMath1373.05050OpenAlexW2602240138MaRDI QIDQ5367530
Publication date: 20 October 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830917500367
Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of Menger's theorem
- Prefibers and the cartesian product of metric spaces
- Gated sets in metric spaces
- Axiomatic characterization of the interval function of a graph
- Cycles in weighted graphs
- Convexities related to path properties on graphs
- The interval function of a connected graph and road systems
- On spanning connected graphs
- The All-Paths Transit Function of a Graph
- Partial trees in weighted graphs-I
- Distance in Graphs
- On maximal paths and circuits of graphs
- Ternary spaces, media, and Chebyshev sets
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
- Median Algebra
- Geodesics and steps in a connected graph
- A characterization of the interval function of a connected graph
This page was built for publication: On transit functions in weighted graphs