Distance matrix polynomials of trees

DOI10.1016/0001-8708(78)90005-1zbMath0382.05023MaRDI QIDQ1247981

László Lovász, Ronald L. Graham

Publication date: 1978

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0001-8708(78)90005-1

Mathematics Subject Classification ID

05C05: Trees

15A18: Eigenvalues, singular values, and eigenvectors

Related Items

Graph theory (algorithmic, algebraic, and metric problems), Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices, A constructive algorithm for realizing a distance matrix, On Euclidean distance matrices, On some counting polynomials in chemistry, A note on distance matrices with unicyclic graph realizations, On the geometry and Laplacian of a graph, Factoring distance matrix polynomials, Laplacian matrices of graphs: A survey, On distance matrices and Laplacians, Decomposition of the complete r-graph into complete r-partite r-graphs, On a conjecture of Graham and Lovász about distance matrices, The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations, A \(q\)-analogue of the distance matrix of a tree, A simple proof of Graham and Pollak's theorem, Distance matrix and Laplacian of a tree with attached graphs, On Isometric Embeddings of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spektren endlicher Grafen
• On the distance matrix of a tree
• On subgraph number independence in trees
• Parallel concepts in graph theory
• The characteristic polynomial of a graph
• On the eigenvalues of trees
• On the distance matrix of a directed graph
• On the Addressing Problem for Loop Switching
• On the Addressing Problem of Loop Switching