The Gomory-Hu inequality and trees

Abstract: Let $G=(V,E)$ be a finite connected graph with vertex set $V$ and edge set $E$, and let $U(G)$ be the set of all ultrametric spaces $(V,d_l)$ generated by vertex labelings $l\colon V \to \mathbb R<sup>+$. We prove that the inequality $|D(V)| \le |E| + 1$ holds for all $(V,d_l) \in U(G)$, where $D(V)$ is the distance set of $(V,d_l)$. The necessary and sufficient conditions under which the above inequality turns to an equality are found. Moreover, we prove that each connected graph with non-negative vertex labeling generates a pseudoultrametric space and find some sufficient conditions under which this space is ultrametric.

• The paper establishes a connection between graph labelings and the structure of ultrametric distance sets by extending the Gomory-Hu inequality.
• The paper shows that trees uniquely achieve the extremal condition |D(V)| = |E| + 1 through the use of injective weight functions on their edges.
• The paper provides a universal framework for constructing ultrametric spaces from any finite connected graph by leveraging a spanning tree with non-degenerate labels.

The Gomory-Hu Inequality and Trees: Graph-Theoretic Generators of Ultrametric Spaces

Introduction

This paper provides a rigorous study of ultrametric spaces generated by labeled graphs by establishing precise connections between the combinatorics of graph labelings and the structure of the resulting (pseudo)ultrametric distance sets. The focus is the Gomory-Hu inequality, originally arising from flow-min-cut dualities and reformulated within ultrametric theory as an upper bound on the cardinality of the distance set of finite ultrametric spaces. The authors present a graph-theoretic approach to the extremal and structural properties of the inequality, synthesizing and extending classical characterizations with new results for labeled trees and general connected graphs.

Ultrametrics Induced by Labeled Graphs

Let $G=(V,E)$ be a finite connected graph, and $l:V\to\mathbb R^+$ a vertex labeling. The authors define a (pseudo)ultrametric $d_l$ on $V$ by

$$d_l(x,y) = \inf_{P \in \mathcal{P}_{x,y}} \max_{v \in V(P)} l(v)$$

where $\mathcal{P}_{x,y}$ is the set of all paths in $G$ connecting $x$ and $y$. For trees, this specializes to

$d_l(x,y) = \max_{v \in V(P_{xy})} l(v)$

where $l:V\to\mathbb R^+$0 is the unique path between $l:V\to\mathbb R^+$1 and $l:V\to\mathbb R^+$2.

The initial segments of the work (Theorem~\ref{tteo5}, Corollary~\ref{esghkl}) establish that for any connected graph $l:V\to\mathbb R^+$3 and non-negative labeling $l:V\to\mathbb R^+$4, $l:V\to\mathbb R^+$5 is always a pseudoultrametric, and is an ultrametric if and only if the labeling is non-degenerate: for every edge $l:V\to\mathbb R^+$6, $l:V\to\mathbb R^+$7. For locally finite graphs, this condition is also necessary.

Gomory-Hu Inequality in the Graph-Generated Context

The core result extends the classic Gomory-Hu inequality to pseudoultrametrics generated by labeled graphs: $l:V\to\mathbb R^+$8 where $l:V\to\mathbb R^+$9 is the set of distinct nonzero values attained by $d_l$0 on $d_l$1. The equivalence conditions under which equality is achieved are systematically developed (Theorem~\ref{mak}):

• There exists a labeling $d_l$2 with $d_l$3 if and only if $d_l$4 is a tree.
• For general graphs, the maximum is only achieved when every edge forms the unique path between its endpoints—i.e., the acyclic case—thus $d_l$5 must be a tree.

Characterization for Trees

Strong structural results are proved for the tree case (Theorem~\ref{tteo6}). For a finite labeled tree $d_l$6 with non-degenerate labeling,

$d_l$7

if and only if the associated edge weight function $d_l$8 is injective. This connects extremal ultrametric spaces for the Gomory-Hu bound to the injectivity of weights on the tree, enabling combinatorial enumeration and classification of extremal spaces.

Universal Construction

It is shown that any finite connected graph $d_l$9 can, for a suitable labeling, generate a “GH-space”—an ultrametric space where the Gomory-Hu bound is attained—by extension from a spanning tree with injective, level-respecting labels.

Pseudoultrametrics Versus Ultrametrics: Obstructions and Exceptions

The work highlights precise mechanisms whereby the construction fails to yield a genuine ultrametric space even for non-degenerate labelings, notably for graphs which are not locally finite or which exhibit certain infinite cycle structures. Explicit examples reveal circumstances where the ultrametricity is lost due to limiting path considerations.

The paper also investigates for which graphs and which classes of labelings the induced distance is always ultrametric, and proposes conjectures towards classifying all such graphs.

Implications and Prospective Directions

Formally, the results anchor the extremal theory of finite ultrametric spaces (with sharp distance set bounds) to the combinatorics of labeled trees. Practically, these findings provide tools for:

• Constructing ultrametric spaces with prescribed distance spectrum cardinality, relevant for hierarchical clustering and phylogenetics.
• Designing extremal examples and counterexamples in the study of metric spaces, weighted graphs, and embeddings.
• Informing algorithms for inference of ultrametric structures in discrete data via injective graph labelings.

On the theoretical side, the direct correspondence established between isometry types of ultrametric spaces (up to distance set structure) and labeled trees opens the way for a systematic isometric classification program of $V$0 spaces. The conjectures raised in the concluding section identify the classification of $V$1-spaces and the characterization of universality/discreteness phenomena as open problems of significant combinatorial and topological depth.

Conclusion

This paper rigorously bridges the combinatorics of labeled trees and graphs with the structure theory of finite ultrametric spaces and the Gomory-Hu inequality. It provides complete criteria for achieving extremal distance set cardinality, exact mechanisms of (pseudo)ultrametricity in graph-generated metric spaces, and reductions to tree structures for general finite graphs. The results contribute a precise toolkit for researchers characterizing and constructing extremal ultrametrics, with direct implications in discrete mathematics, theoretical computer science, and applied hierarchical modeling.