pith. sign in

arxiv: 1907.09462 · v1 · pith:OOHQOJ5Mnew · submitted 2019-07-22 · 🧮 math.CO

On spectral spread of generalized distance matrix of a graph

Hilal A. Ganie , S. Pirzada , A. Alhevaz , M. Baghipur This is my paper

Pith reviewed 2026-05-24 17:53 UTC · model grok-4.3

classification 🧮 math.CO
keywords generalized distance matrixspectral spreaddistance Laplacianbipartite graphsclique numberindependence numberextremal graphs
0
0 comments X

The pith

The generalized distance spectral spread D_αS(G) is bounded below using bipartiteness, clique number, and independence number.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines the generalized distance matrix D_α(G) as the convex combination α Tr(G) + (1-α) D(G) for a simple connected graph G. It examines the spread D_αS(G) between the largest and smallest eigenvalues of this matrix. Bounds are derived that relate D_αS(G) to the ordinary distance spectral spread S_D(G). Explicit lower bounds are given when G is bipartite or when the clique and independence numbers are fixed, and the graphs attaining these bounds are identified in several cases. These results merge the spectral theories of the distance, distance Laplacian, and distance signless Laplacian matrices under a single parameter.

Core claim

The paper establishes bounds for the generalized distance spectral spread D_αS(G) = ∂1(G) − ∂n(G) of D_α(G), including a relation between D_αS(G) and the distance spectral spread S_D(G), lower bounds for bipartite graphs involving various graph parameters with extremal graphs characterized, and lower bounds in terms of the clique number and independence number of G with extremal graphs characterized in some cases.

What carries the argument

The generalized distance matrix D_α(G) = α Tr(G) + (1-α) D(G) for 0 ≤ α ≤ 1, with its eigenvalue spread D_αS(G) serving as the central quantity for which bounds and extremal graphs are proved.

If this is right

  • D_αS(G) is related to S_D(G) by a factor that depends on the choice of α.
  • Lower bounds on D_αS(G) hold for every bipartite graph and involve parameters such as order or diameter, with the extremal graphs identified.
  • Lower bounds on D_αS(G) hold in terms of the clique number and the independence number, with the extremal graphs identified in some cases.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same bounding technique could be applied to other convex combinations of graph matrices to obtain analogous spread results.
  • The extremal graphs identified for bipartite cases may coincide with distance-regular graphs, allowing direct verification on known families.
  • These spread bounds supply a parameter-free way to compare distance-based spectra across graphs of different sizes.

Load-bearing premise

The graph G must be simple and connected so that the distance matrix D(G) and transmission matrix Tr(G) are well-defined.

What would settle it

A concrete counterexample would be any specific connected graph, such as the path on five vertices, whose computed D_αS(G) for some α lies strictly below the paper's stated lower bound expressed in terms of the independence number.

read the original abstract

For a simple connected graph $G$, let $D(G)$, $Tr(G)$, $D^{L}(G)$ and $D^{Q}(G)$, respectively be the distance matrix, the diagonal matrix of the vertex transmissions, distance Laplacian matrix and the distance signless Laplacian matrix of a graph $G$. The convex linear combinations $D_{\alpha}(G)$ of $Tr(G)$ and $D(G)$ is defined as $D_{\alpha}(G)=\alpha Tr(G)+(1-\alpha)D(G)$, $0\leq \alpha\leq 1$. As $D_{0}(G)=D(G), ~~~ 2D_{\frac{1}{2}}(G)=D^{Q}(G), ~~~ D_{1}(G)=Tr(G)$ and $D_{\alpha}(G)-D_{\beta}(G)=(\alpha-\beta)D^{L}(G)$, this matrix reduces to merging the distance spectral, distance Laplacian spectral and distance signless Laplacian spectral theories. Let $\partial_{1}(G)\geq \partial_{2}(G)\geq \dots \geq \partial_{n}(G)$ be the eigenvalues of $D_{\alpha}(G)$ and let $D_{\alpha}S(G)=\partial_{1}(G)-\partial_{n}(G)$ be the generalized distance spectral spread of the graph $G$. In this paper, we obtain some bounds for the generalized distance spectral spread $D_{\alpha}(G)$. We also obtain relation between the generalized distance spectral spread $D_{\alpha}(G)$ and the distance spectral spread $S_{D}(G)$. Further, we obtain the lower bounds for $D_{\alpha}S(G)$ of bipartite graphs involving different graph parameters and we characterize the extremal graphs for some cases. We also obtain lower bounds for $D_{\alpha}S(G)$ in terms of clique number and independence number of the graph $G$ and characterize the extremal graphs for some cases.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The paper defines the generalized distance matrix D_α(G) = α Tr(G) + (1-α) D(G) for 0 ≤ α ≤ 1 on a simple connected graph G. It introduces the generalized distance spectral spread D_αS(G) = ∂1(G) − ∂n(G), where ∂i are the eigenvalues of D_α(G), and claims to derive bounds on D_αS(G), a relation between D_αS(G) and the distance spectral spread S_D(G), lower bounds on D_αS(G) for bipartite graphs (with extremal characterizations), and lower bounds in terms of the clique number and independence number (again with extremal characterizations). Special cases recover the distance matrix (α=0), distance signless Laplacian (α=1/2), and transmission matrix (α=1).

Significance. If the claimed bounds and characterizations are correct, the work unifies distance, distance-Laplacian, and distance-signless-Laplacian spectral theories under a single convex-combination parameter α and supplies concrete extremal results for the spread on bipartite graphs and in terms of ω(G) and α(G). Such results would be of interest to researchers working on distance-based spectral invariants.

major comments (1)
  1. [Abstract and main body] The manuscript text supplied contains no proofs, derivations, or verification steps supporting any of the stated bounds or characterizations. This is load-bearing because the central contribution is precisely the existence and sharpness of these results.
minor comments (2)
  1. [Abstract] The abstract states that D_α(G) − D_β(G) = (α − β) D^L(G) but does not explicitly recall the definition of the distance Laplacian D^L(G) = Tr(G) − D(G); a one-sentence reminder would improve readability.
  2. [Abstract] Notation for the spread is introduced as D_αS(G) immediately after the eigenvalues; it would be clearer to write the definition D_αS(G) := ∂1(G) − ∂n(G) on its own line.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their report and for highlighting the need for explicit support of the claimed results. We address the single major comment below.

read point-by-point responses

  1. Referee: [Abstract and main body] The manuscript text supplied contains no proofs, derivations, or verification steps supporting any of the stated bounds or characterizations. This is load-bearing because the central contribution is precisely the existence and sharpness of these results.

    Authors: The referee is correct that the text provided for review consists only of the abstract and contains no proofs or derivations. The full manuscript on arXiv:1907.09462 is stated to contain the bounds, the relation to the distance spectral spread, the lower bounds for bipartite graphs with extremal graphs, and the bounds in terms of clique and independence numbers with extremal graphs, but these supporting arguments are absent from the supplied excerpt. We will revise the submission to include the complete proofs, derivations, and verification steps for all stated results. revision: yes

Circularity Check

0 steps flagged

No significant circularity; bounds derived from standard matrix inequalities

full rationale

The paper defines the generalized distance matrix D_α(G) as the convex combination α Tr(G) + (1-α) D(G) and the spread D_αS(G) as the difference of its largest and smallest eigenvalues. All claimed results are bounds, relations to the ordinary distance spread S_D(G), and extremal characterizations for bipartite graphs or in terms of clique/independence numbers. These are obtained via standard techniques such as eigenvalue interlacing, Rayleigh quotients, or direct comparison of matrix entries, none of which reduce by construction to fitted parameters or prior self-citations. The definitions are internally consistent with the distance-matrix literature and introduce no self-referential loops; the derivation chain therefore remains self-contained against external graph invariants.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 0 invented entities

The paper rests on the standard definitions of distance matrix and transmission matrix for simple connected graphs together with the linear-algebra fact that eigenvalues of a symmetric matrix are real and can be ordered.

free parameters (1)
  • alpha
    The mixing parameter 0 ≤ α ≤ 1 that defines the family; it is not fitted to data but chosen to recover the three classical cases.
axioms (2)
  • domain assumption G is a simple connected graph
    Invoked in the first sentence to ensure D(G) and Tr(G) are defined.
  • standard math The eigenvalues of a real symmetric matrix are real and can be ordered decreasingly
    Implicit in the definition of ∂1(G) ≥ … ≥ ∂n(G).

pith-pipeline@v0.9.0 · 5905 in / 1269 out tokens · 33300 ms · 2026-05-24T17:53:54.354741+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

  1. [1]

    Aouchiche and P

    M. Aouchiche and P. Hansen, Distance spectra of graphs: a sur vey, Linear Algebra Appl. 458 (2014) 301–386

    work page 2014

  2. [2]

    Aouchiche and P

    M. Aouchiche and P. Hansen, Two Laplacians for the distance mat rix of a graph, Linear Algebra Appl. 439 (2013) 21–33

    work page 2013

  3. [3]

    Alhevaz, M

    A. Alhevaz, M. Baghipur and E. Hashemi, Further results on the d istance signless Laplacian spectrum of graphs, Asian-European J. Math. 11(05) (2018) 1850067

    work page 2018

  4. [4]

    Alhevaz, M

    A. Alhevaz, M. Baghipur, Hilal A. Ganie and S. Pirzada, A conjectu re on the sum of the distance signless Laplacian eigenvalues of a graph, communicated

    work page

  5. [5]

    Atik and P

    F. Atik and P. Panigrahi, On the distance and distance signless Lap lacian eigenvalues of graphs and the smallest Gerˆ sgorin disc, Elect. J. Linear Algebra 34 (2018) 191–204

    work page 2018

  6. [6]

    Brouwer and W

    A. Brouwer and W. Haemers, Spectra of Graphs, Springer, New York, 2012

    work page 2012

  7. [7]

    S. Y. Cui, J. X. He and G. X. Tian, The generalized distance matrix, Linear Algebra Appl. 563 (2019) 1–23

    work page 2019

  8. [8]

    Cvetkovic, M

    D. Cvetkovic, M. Doob and H. Sachs, Spectra of graphs-Theor y and Application, Academic Press, New York, 1980

    work page 1980

  9. [9]

    Indulal, Sharp bounds on the distance spectral radius and th e distance energy of graphs, Linear Algebra Appl

    G. Indulal, Sharp bounds on the distance spectral radius and th e distance energy of graphs, Linear Algebra Appl. 430 (2009) 1061–113

    work page 2009

  10. [10]

    Lin and B

    H. Lin and B. Zhou, On the distance Laplacian spectral radius of graphs, Linear Algebra Appl. 475 (2015) 265–275

    work page 2015

  11. [11]

    Mirsky, The spread of a matrix, Mathematika 3 (1956) 127–130

    L. Mirsky, The spread of a matrix, Mathematika 3 (1956) 127–130

    work page 1956

  12. [12]

    X. Ma, L. Qi, F. Tian and D. Wong, Graphs with some distance Lapla cian eigenvalue of multiplicity n − 3, Linear Algebra Appl. 557 (2018) 307–326

    work page 2018

  13. [13]

    Pirzada, An Introduction to Graph Theory, Universities Pre ss, OrientBlackSwan, Hyder- abad, 2012

    S. Pirzada, An Introduction to Graph Theory, Universities Pre ss, OrientBlackSwan, Hyder- abad, 2012. On spectral spread of generalized distance matrix of a graph 17

    work page 2012

  14. [14]

    Stevanovi´ c and A

    D. Stevanovi´ c and A. Ili´ c, Spectral properties of distanc e matrix of graphs, Mathematical Chemistry Monographs, I. Gutman and B. Furtula (Eds.), Distance in Molecular Graphs -Theory, Univ. Kragujevac, Kragujevac, 2012, 139–176

    work page 2012

  15. [15]

    So, Commutativity and spectra of Hermitian matrices, Linear Algebra Appl

    W. So, Commutativity and spectra of Hermitian matrices, Linear Algebra Appl. 212/213 (1994) 121-129

    work page 1994

  16. [16]

    L. You, L. Ren and G. Yu, Distance and distance signless Laplacia n spread of connected graphs, Discrete Appl. Math. 223 (2017) 140-147

    work page 2017

  17. [17]

    G. Yu, H. Zhang, H. Lin, Y. Wu and J. Shu, Distance spectral sp read of a graph, Discrete Appl. Math. 160 (2012) 2474-2478

    work page 2012