Two Laplacians for the distance matrix of a graph

By Mustapha Aouchiche, Pierre Hansen. 2011

271 citations recorded by the source corpus.

Subfields: Geometry and Topology, Materials Chemistry, Organic Chemistry

View Paper: https://www.semanticscholar.org/paper/eaad3f2b66f07a86f63ec5b98331b659a8ca70d5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Geometry and Topology

1. Pierre Hansen
2. Mustapha Aouchiche

In Materials Chemistry

1. Pierre Hansen
2. Mustapha Aouchiche

In Organic Chemistry

1. Mustapha Aouchiche
2. Pierre Hansen

Citations in the corpus

• On the distance signless Laplacian of a graph (2014, methodology): “Also in [4], and similarly to the (adjacency) signless Laplacian L = Diag(Deg)+ A, we introduced the distance signless Laplacian of a connected graph G to be DQ = Diag(T r)+ D.”
• Some properties of the distance Laplacian eigenvalues of a graph (2013, methodology): “A similar result for the distance and the distance Laplacian spectra over the class of transmission regular graphs is proved in [3].”