Skip to content

A Comparison of Ball and Weighted Embeddings

Unknown authors
· 0 citations · 22 references

TL;DR

This work compares ball-and weighted graphs and gives a complete comparison in the one-dimensional case, and shows that the minimal dimension for ball graphs can at most be one larger than the minimal dimension for weighted graphs (weighted dimension), but also that the weighted dimension can exceed the ball dimension by an arbitrary amount.

View source

Similar papers

Comparing Geometric Embeddings of Graphs

It is proved that ( 𝑑 + 1 ) -dimensional random dot product graphs generalize 𝑑 -dimensional random ball graphs up to constant factors and vice versa.

Unknown authors · 0 citations
Review Open access Sep 2026

Graph Embeddings on Surfaces: A Classical Review of Topological Graph Theory

Topological graph theory studies graphs in relation to the surfaces on which they can be drawn. This review presents the main classical ideas of the field in a clear and connected framework. It begins with graph embeddings, Euler’s formula, and the basic principles of planar graphs. It then discusses important classica...

Ghadeer Khudhair Obayes, Karrar Khudhair Obayes · 0 citations
Preprint Aug 2026

Diameter and Length of Metric Graphs

A metric graph is a metric space obtained from a finite collection of intervals whose endpoints are identified in groups. It can also be seen as a finite, edge-weighted graph where the continuum of points along the interior of each edge is taken into consideration, and each edge is locally isometric to an interval whos...

Hee-Kap Ahn, Sergio Cabello, O. Cheong et al. · 0 citations
Open access Sep 2026

Distance Magic Labelings of Complete Bipartite Graphs Obtained by Partition Modification

The existence and construction of distance magic labelings for certain families of complete bipartite graphs are investigated to contribute to the understanding of how arithmetic structure and partition properties influence the existence of distance magic labelings.

Kaveesha V. Senarathna, Sujeeva Wijesiri, S. Almeida · 0 citations
Preprint Aug 2026

Uniformly Weighted Graphical Designs

A graphical design is a subset of vertices of a graph, along with a weight for each chosen vertex, that can perfectly average chosen subspaces of functions on the graph. A design is uniformly weighted if all the weights are equal, and several well-known combinatorial objects such as orthogonal arrays, combinatorial blo...

Zawad Chowdhury, Rekha R. Thomas · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.