Distance matrices on the \textit{H-join} of graphs: a general result and applications
From MaRDI portal
Publication:1794312
DOI10.1016/j.laa.2018.08.024zbMath1401.05179OpenAlexW2889266407MaRDI QIDQ1794312
Roberto C. Díaz, Oscar Rojo, Domingos Moreira Cardoso
Publication date: 15 October 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.08.024
eigenvaluesvertex connectivitydistance matrixgraph operationsdistance incidence energydistance Laplacian-energy like
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph operations (line graphs, products, etc.) (05C76)
Related Items
On distance signless Laplacian spectrum of graphs and spectrum of zero divisor graphs of ℤn, SEIDEL SPECTRUM OF THE ZERO-DIVISOR GRAPH ON THE RING OF INTEGERS MODULO n, On the distance \(\alpha \)-spectral radius of a connected graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of extremal graphs from distance signless Laplacian eigenvalues
- Two Laplacians for the distance matrix of a graph
- The Laplacian-energy like of graphs
- On the group of the composition of two graphs
- The composition of graphs
- Laplacian energy of a graph
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- On optimal realizations of finite metric spaces by graphs
- A note on distance matrices with unicyclic graph realizations
- Trees related to realizations of distance matrices
- On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
- A note on the metric properties of trees
- A sharp upper bound on the incidence energy of graphs in terms of connectivity
- Spectra of graphs obtained by a generalization of the join graph operation
- Eigenvalues of a \(H\)-generalized join graph operation constrained by vertex subsets
- Distance spectra of graphs: a survey
- Large sets of long distance equienergetic graphs
- The Complexity of Metric Realization
- Distance matrix of a graph and its realizability
- Properties of the distance matrix of a tree
- A note on the tree realizability of a distance matrix
- On the Addressing Problem for Loop Switching
- On the distance and distance Laplacian eigenvalues of graphs
