A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak

DOI10.1137/110831520zbMath1248.05115OpenAlexW1964148561MaRDI QIDQ2910932

Kota Ishii, Saori Watanabe, Masanori Sawa

Publication date: 12 September 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110831520

zbMATH Keywords

distance matrixhypertrees, isometric embedding

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Special maps on metric spaces (54E40)

Related Items (11)

The generalized distance spectrum of a graph and applications ⋮ Unnamed Item ⋮ Minimizing the distance spectral radius of uniform hypertrees with given parameters ⋮ On a symmetric representation of Hermitian matrices and its applications to graph theory ⋮ Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue ⋮ A proof of a conjecture on the distance spectral radius ⋮ Wiener index and addressing of the total graph ⋮ Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs ⋮ Addressing graph products and distance-regular graphs ⋮ A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree ⋮ Distance (signless) Laplacian eigenvalues of \(k\)-uniform hypergraphs

This page was built for publication: A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak