Distance matrix polynomials of trees
From MaRDI portal
Publication:1247981
DOI10.1016/0001-8708(78)90005-1zbMath0382.05023OpenAlexW2116451290MaRDI 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
Related Items
The product distance matrix of a tree with matrix weights on its arcs, Proof of a conjecture of Graham and Lov\'asz concerning unimodality of coefficients of the distance characteristic polynomial of a tree, Steiner distance matrix of caterpillar graphs, The generalized distance spectrum of a graph and applications, Distance matrix of a class of completely positive graphs: determinant and inverse, Computing the determinant of the distance matrix of a bicyclic graph, \(q\)-analogs of distance matrices of 3-hypertrees, On distance matrices of wheel graphs with an odd number of vertices, On some counting polynomials in chemistry, Resistance matrices of balanced directed graphs, The distance matrix of a tree with weights on its arcs, A constructive algorithm for realizing a distance matrix, A problem on distance matrices of subsets of the Hamming cube, On the rank of the distance matrix of graphs, On the distance signless Laplacian spectral radius of graphs, On mixed block graphs, A note on distance matrices with unicyclic graph realizations, Distance spectral radius of trees with given number of segments, On Euclidean distance matrices, Two Laplacians for the distance matrix of a graph, The inertia of distance matrices of some graphs, A short note on a short remark of Graham and Lovász, Resistance matrices of graphs with matrix weights, The ancestral matrix of a rooted tree, Bounds on the \(\alpha \)-distance energy and \(\alpha \)-distance Estrada index of graphs, On a symmetric representation of Hermitian matrices and its applications to graph theory, Some graft transformations and its applications on the distance spectral radius of a graph, The distance signatures of the incidence graphs of affine resolvable designs, On distance spectral radius of graphs, Distance spectral radius of trees with fixed number of pendent vertices, On the distance and distance signless Laplacian spectral radii of bicyclic graphs, On distance spectral radius of uniform hypergraphs with cycles, The exponential distance matrix of block graphs, On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs, Mathematical Aspects of Omega Polynomial, Sharp bounds for the spectral radius of nonnegative matrices, On least distance eigenvalue of uniform hypergraphs, On the geometry and Laplacian of a graph, An inverse formula for the distance matrix of a wheel graph with an even number of vertices, On Isometric Embeddings of Graphs, The determinant of the distance matrix of graphs with blocks at most bicyclic, The distance energy of clique trees, Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees, Gain distance matrices for complex unit gain graphs, ON THE MAXIMAL DISTANCE SPECTRAL RADIUS IN A CLASS OF BICYCLIC GRAPHS, The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations, The bipartite distance matrix of a nonsingular tree, The inverse of the distance matrix of a distance well-defined graph, On the two largest distance eigenvalues of graph powers, On the distance and distance signless Laplacian spectral radii of tricyclic graphs, The distance spectral radius of trees, The effect of a graft transformation on distance spectral radius, Distance spectra of graphs: a survey, The distance spectra of Cayley graphs of Coxeter groups, Moore-Penrose inverse of a Euclidean distance matrix, Identities for minors of the Laplacian, resistance and distance matrices, A \(q\)-analogue of the distance matrix of a tree, Distance matrices of subsets of the Hamming cube, A simple proof of Graham and Pollak's theorem, On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices, Distance spectra and distance energy of integral circulant graphs, Multicovering hypergraphs, On distance matrices and Laplacians, On a conjecture of Graham and Lovász about distance matrices, Graph theory (algorithmic, algebraic, and metric problems), The distance matrix of caterpillar, Unnamed Item, Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix, Inverse of the distance matrix of a weighted cactoid digraph, Product distance matrix of a tree with matrix weights, Inverses of \(q\)-distance matrices of a tree, The distance spectrum of two new operations of graphs, Distance spectral radii of k-uniform hypertrees with given parameters, On distance and Laplacian matrices of trees with matrix weights, Distance spectral radius of uniform hypergraphs, The distance spectral radius of graphs with given number of odd vertices, Inverse of the distance matrix of a cycle-clique graph, Connectivity and minimal distance spectral radius of graphs, Decomposition of the complete r-graph into complete r-partite r-graphs, Cluj polynomials, Omega polynomial in twisted/chiral polyhex tori, On the distance \(\alpha \)-spectral radius of a connected graph, Inverse of the distance matrix of a block graph, Effective resistance is more than distance: Laplacians, simplices and the Schur complement, Bounds for the Graham-Pollak theorem for hypergraphs, The 2-Steiner distance matrix of a tree, Another simple proof of Graham and Pollak's theorem, Further results on the distance spectral radius of graphs, A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree, Distance matrix and Laplacian of a tree with attached graphs, Squared distance matrix of a weighted tree, Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices, Factoring distance matrix polynomials, Inverse of the distance matrix of a cactoid digraph, On the distance spectrum of distance regular graphs, The metric dimension & distance spectrum of non-commuting graph of dihedral group, Laplacian matrices of graphs: A survey, Graphs that are cospectral for the distance Laplacian, On the resistance matrix of a graph, Ordering trees by their distance spectral radii, Distance matrix of a multi-block graph: determinant and inverse, An inverse formula for the distance matrix of a fan graph, The bipartite Laplacian matrix of a nonsingular tree, Distance matrices of a tree: two more invariants, and in a unified framework, On the distance spectra ofm-generationn-prism graph, A \(q\)-analogue of distance matrix of block graphs, On resistance matrices of weighted balanced digraphs, Blowup polynomials and delta-matroids of graphs, A generalization of the Graham-Pollak tree theorem to Steiner distance, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Inverse of the distance matrix of a bi-block graph, On the second largest distance eigenvalue, Squared distance matrix of a tree: inverse and inertia, Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights, Distance matrix of weighted cactoid-type digraphs
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item