Continuous mean distance of a weighted graph
From MaRDI portal
Publication:6045116
DOI10.1007/s00025-023-01902-wzbMath1515.05083arXiv2103.11676OpenAlexW3136531308MaRDI QIDQ6045116
Alberto Márquez, Delia Garijo, Rodrigo I. Silveira
Publication date: 26 May 2023
Published in: Results in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.11676
Graph theory (including graph drawing) in computer science (68R10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Distance in graphs (05C12) Signed and weighted graphs (05C22) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average distance in weighted graphs
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- The edge-Wiener index of a graph
- Eigenvalues, diameter, and mean distance in graphs
- Mean distance in a graph
- Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
- An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs
- The edge-Wiener index and the edge-hyper-Wiener index of phenylenes
- Adjacency matrix and Wiener index of zero divisor graph \(\varGamma (Z_n)\)
- Mathematical aspects of Wiener index
- Undirected single-source shortest paths with positive integer weights in linear time
- An edge version of the matrix-tree theorem and the wiener index
- On the sum of all distances in a graph or digraph
- Edge-vulnerability and mean distance
- Mean distance for shapes
- Distance in graphs
- Mean distance and minimum degree
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
- A Shortest Path Algorithm for Real-Weighted Undirected Graphs
- Fast approximation algorithms for the diameter and radius of sparse graphs
- On the Volume of a Class of Truncated Prisms and Some Related Centroid Problems
- Faster shortest-path algorithms for planar graphs
