Distance spectra of graphs: a survey (Q2250935)

From MaRDI portal

Revision as of 19:27, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Distance spectra of graphs: a survey	scientific article

Statements

scholarly article

0 references

Distance spectra of graphs: a survey (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.laa.2014.06.010

0 references

Mustapha Aouchiche

0 references

0 references

Linear Algebra and its Applications

0 references

publication date

22 July 2014

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

distance matrix

0 references

eigenvalues

0 references

largest eigenvalue

0 references

characteristic polynomial

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.laa.2014.06.010

0 references

0 references

On optimal realizations of finite metric spaces by graphs

0 references

0 references

0 references

0 references

A survey of Nordhaus-Gaddum type relations

0 references

On a conjecture about the Szeged index

0 references

A survey on integral graphs

0 references

Recognition of Tree Metrics

0 references

Determinant of the distance matrix of a tree with matrix weights

0 references

Distance matrix and Laplacian of a tree with attached graphs

0 references

On distance matrices and Laplacians

0 references

Properties of the distance matrix of a tree

0 references

On the maximal distance spectral radius of graphs without a pendent vertex

0 references

On the distance spectral radius of cacti

0 references

Distance spectral radius of graphs with \(r\) pendent vertices

0 references

0 references

A computational attack on the conjectures of Graffiti: New counterexamples and proofs

0 references

0 references

Spectra of graphs

0 references

0 references

A note on the metric properties of trees

0 references

On the use of an inverse shortest paths algorithm for recovering linearly correlated costs

0 references

0 references

Variable neighborhood search for extremal graphs. I: The AutoGraphiX system

0 references

Distance realization problems with applications to internet tomography

0 references

Factoring distance matrix polynomials

0 references

On a conjecture of Graham and Lovász about distance matrices

0 references

0 references

A fast algorithm for constructing trees from distance matrices

0 references

Free trees and bidirectional trees as representations of psychological distance

0 references

0 references

Recent results in the theory of graph spectra

0 references

Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph

0 references

0 references

0 references

Geometry of cuts and metrics

0 references

A note on two problems in connexion with graphs

0 references

Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces

0 references

An algorithm for computing cutpoints in finite metric spaces

0 references

Further results on the distance spectral radius of graphs

0 references

Sharp bounds on the spectral radius of a nonnegative matrix

0 references

On the distance matrix of a tree

0 references

Addressing the Petersen graph

0 references

New Bounds on the Complexity of the Shortest Path Problem

0 references

On the distance matrix of a directed graph

0 references

Distance matrix polynomials of trees

0 references

0 references

On the Addressing Problem for Loop Switching

0 references

On Isometric Embeddings of Graphs

0 references

0 references

On the distance spectral radius and the distance energy of graphs

0 references

Distance matrix of a graph and its realizability

0 references

THE MAXIMUM CONNECTIVITY OF A GRAPH

0 references

0 references

The metric cutpoint partition problem

0 references

On some counting polynomials in chemistry

0 references

0 references

Bounds on the largest eigenvalues of trees with a given size of matching

0 references

Distance spectral radius of trees with given matching number

0 references

Distance spectra and distance energy of integral circulant graphs

0 references

0 references

On optimal embeddings of metrics in graphs

0 references

Distance spectrum of graph compositions

0 references

Sharp bounds on the distance spectral radius and the distance energy of graphs

0 references

0 references

0 references

0 references

Optimal realizations of generic five-point metrics

0 references

Distance-regular graphs the distance matrix of which has only one positive eigenvalue

0 references

0 references

The Similarity Metric

0 references

Minimum Distance Spectral Radius of Graphs with Given Edge Connectivity

0 references

Distance spectral radius of digraphs with given connectivity

0 references

On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs

0 references

0 references

On spectral radius of the distance matrix

0 references

0 references

The distance spectrum of a tree

0 references

On the distance spectral radius of trees

0 references

On the distance spectral radius of bipartite graphs

0 references

0 references

Distance spectral radius of trees with fixed number of pendent vertices

0 references

On Complementary Graphs

0 references

The distance matrix of a graph and its tree realization

0 references

ON THE MAXIMAL DISTANCE SPECTRAL RADIUS IN A CLASS OF BICYCLIC GRAPHS

0 references

0 references

0 references

Distance spectra and distance energies of iterated line graphs of regular graphs

0 references

The distance spectrum of the path<i>P<sub>n</sub></i>and The First Distance Eigenvector of Connected Graphs

0 references

The centrality index of a graph

0 references

An algorithm and its role in the study of optimal graph realizations of distance matrices

0 references

An Optimality Criterion for Graph Embeddings of Metrics

0 references

A note on distance matrices with unicyclic graph realizations

0 references

A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices

0 references

A note on the tree realizability of a distance matrix

0 references

0 references

Submatrices of non-tree-realizable distance matrices

0 references

Integral circulant graphs

0 references

0 references

Large sets of long distance equienergetic graphs

0 references

Distance spectral radius of trees with fixed maximum degree

0 references

The distance spectrum and energy of the compositions of regular graphs

0 references

0 references

A constructive algorithm for realizing a distance matrix

0 references

Trees related to realizations of distance matrices

0 references

On distance spectral radius of graphs

0 references

The Complexity of Metric Realization

0 references

Sharp bounds for the spectral radius of nonnegative matrices

0 references

On the distance and distance signless Laplacian spectral radii of bicyclic graphs

0 references

On the least distance eigenvalue of a graph

0 references

Some graft transformations and its applications on the distance spectral radius of a graph

0 references

Some graft transformations and its application on a distance spectrum

0 references

Distance spectral spread of a graph

0 references

0 references

On the distance spectral radius of some graphs

0 references

The inertia of distance matrices of some graphs

0 references

Connectivity and minimal distance spectral radius of graphs

0 references

The distance matrices of some graphs related to wheel graphs

0 references

0 references

On Distance Spectral Radius and Distance Energy of Graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2250935

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2250935&oldid=35400131"