On a distance Laplacian analog of Brouwer's conjecture for several classes of graphs

Abstract: Zhou et al. (2025) proposed a distance Laplacian analog of Brouwer's conjecture on partial sums of Laplacian eigenvalues, asserting that for any connected graph $G$, $\sum_{i=1}^r \partial_i^L(G)\le W(G)+\binom{r+2}{3},$ where $\partial_i^L(G)$ are the eigenvalues of the distance Laplacian matrix and $W(G)$ is the Wiener index. We prove this inequality for three broad classes of graphs, thereby improving and extending existing results. First, we prove that all connected graphs of diameter at most $D$ satisfy the inequality once the order $n$ satisfies $n\ge\lceil\frac49(D+1)^3\rceil$. Second, we show that the inequality holds for every diameter-$2$ graph with the only exceptions being $K_{1,3}$ at $r=2$ and $K_{1,4}$ at $r=3$. Third, we prove that if the maximum degree is $Δ(G)=n-k$, then the inequality holds for all $n\ge N(k)$, where $N(2)=10$ and $N(k)=\lceil 5(k-1)^{3/2}\rceil$ for $k\ge 3$. Our proofs rely on decomposing the distance Laplacian matrix into Laplacian matrices of auxiliary graphs whose edges are vertex pairs at distance at least a prescribed value, together with classical eigenvalue inequalities.

• The paper establishes that the distance Laplacian eigenvalue sum is bounded by the Wiener index plus a combinatorial term for various structured graph classes.
• It applies matrix decomposition and classical Laplacian inequalities to significantly lower order thresholds, especially for diameter-2 and high maximum degree graphs.
• The work precisely identifies exceptions, such as small star graphs, while providing a robust spectral framework applicable to network and chemical graph theory.

Distance Laplacian Analog of Brouwer's Conjecture: Advances for Structured Graph Classes

Introduction and Context

The paper "On a distance Laplacian analog of Brouwer's conjecture for several classes of graphs" (2606.06945) addresses a natural extension of Brouwer's conjecture, originally posited for the Laplacian eigenvalues of a graph, to the setting of the distance Laplacian matrix. Brouwer's conjecture bounds partial sums of Laplacian eigenvalues in terms of the graph's number of edges and a combinatorial term. Zhou et al. (2025) advanced this theme by proposing an analogous conjecture for the distance Laplacian: for any connected graph $G$ and $1 \le r \le n$,

$$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$

where $\partial_i^L(G)$ denote the eigenvalues of the distance Laplacian matrix, and $W(G)$ is the Wiener index. This paper provides significant progress in verifying this inequality for broad classes of graphs, sharpening bounds and clarifying the structural conditions under which the bound is valid, as well as delineating precise exceptions.

Main Results and Theoretical Contributions

The principal contributions are threefold, each extending the scope or tightening the bounds for the conjectured inequality:

1. Graphs of Bounded Diameter: The paper establishes that for connected graphs with diameter at most $D$, the conjectured upper bound holds for all graph orders $n \geq \left\lceil \frac{4}{9}(D+1)^3 \right\rceil$ and all $r$. This constitutes a substantial reduction in the required order compared to previous results, e.g., for diameter $3$ the inequality is demonstrated for $n \ge 29$ rather than the previous threshold $1 \le r \le n$0.
2. Diameter-Two Graphs—Complete Characterization: The analysis gives a comprehensive solution for connected graphs of diameter $1 \le r \le n$1, proving the conjecture holds universally except for two explicit cases: $1 \le r \le n$2 at $1 \le r \le n$3 and $1 \le r \le n$4 at $1 \le r \le n$5. This exhaustively settles all previously open questions for diameter-$1 \le r \le n$6 graphs.
3. Graphs with Large Maximum Degree: For graphs where the maximum degree is $1 \le r \le n$7, the paper verifies the conjecture for $1 \le r \le n$8, with $1 \le r \le n$9 and $$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$0 for $$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$1. This significantly lowers the thresholds compared to earlier work (e.g., $$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$2 for $$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$3), and establishes the result for all larger $$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$4.

Proof Techniques and Analytical Innovations

Central to the analysis is a decomposition of the distance Laplacian matrix into a sum of Laplacian matrices of auxiliary graphs encoding pairs of vertices at distance at least a given value. This approach reduces spectral inequalities for the distance Laplacian to the more tractable regime of standard Laplacians, thereby leveraging classical results such as the Ky Fan inequality and the Grone–Merris-Bai conjecture (now theorem). In particular, the proofs rely on:

• Auxiliary Distance-at-Least-$$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$5 Graphs ($$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$6): By expressing the distance Laplacian in terms of the Laplacians of $$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$7, for $$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$8, the problem becomes amenable to known eigenvalue bounds and combinatorial analyses.
• Reduction to Known Laplacian Inequalities: In several places, the original Brouwer conjecture for standard Laplacians, already proven for certain values of $$U_r(G) \equiv \sum_{i=1}^r \partial_i^L(G) \le W(G) + \binom{r+2}{3},$$9, is used to establish the case for distance Laplacians in diameter-$\partial_i^L(G)$0 graphs, thanks to explicit spectral relations between a graph and its complement.
• Numerical Optimization and Asymptotic Estimates: The order thresholds for $\partial_i^L(G)$1 in terms of $\partial_i^L(G)$2 and $\partial_i^L(G)$3 are derived via numerical optimization of polynomials in $\partial_i^L(G)$4 and $\partial_i^L(G)$5, ensuring the inequalities remain valid in the asymptotic regime.

Strong/Contradictory Claims and Structural Insights

One bold aspect of the paper is the complete resolution, with minimal and checked exceptions, of the distance Laplacian analog of Brouwer's conjecture for diameter-$\partial_i^L(G)$6 graphs—this result goes beyond merely broad partial results, giving explicit criteria for all parameter regimes.

Additionally, the order thresholds for large maximum degree are lowered by approximately an order of magnitude for the key cases ($\partial_i^L(G)$7), representing a direct contradiction of the previously understood limitations. The results show that only the well-structured small stars $\partial_i^L(G)$8 and $\partial_i^L(G)$9 in specific parameter regimes evade the bound—no further exceptions exist even for smaller graphs.

Implications and Future Directions

From a theoretical perspective, the paper moves the field closer to a complete characterization of spectral partial sum bounds for the distance Laplacian, a less mature but increasingly important area in spectral graph theory. The techniques here, particularly the matrix decomposition approach, provide a template for attacking related spectral inequalities involving non-standard Laplacians or distance-based matrices.

Practically, the results inform spectral-based algorithms—such as those arising in network analysis, synchronization, and chemical graph theory—regarding extremal behaviors and feasibility of using the distance Laplacian as a quantitative measure that is robustly bounded by easy-to-compute graph invariants.

Future research is suggested along two lines:

• Refinement of order thresholds for the bounded-diameter and maximum-degree cases, potentially via sharper combinatorial or probabilistic arguments.
• Extension or adaptation of these techniques to other matrix functionals (e.g., distance signless Laplacian, normalized versions, or weighted variants).

Conclusion

This work gives substantial new proofs for the distance Laplacian analog of Brouwer's conjecture across multiple broad classes of graphs, employing nuanced spectral decomposition methods and sharp combinatorial analysis. The careful delineation of exceptions for diameter-$W(G)$0 graphs and the dramatic lowering of order thresholds for large maximum degree graphs mark significant progress. The methodological advances, particularly the systematic reduction to well-understood Laplacian eigenvalue problems, are likely to stimulate further results in analogous spectral extremal problems.