A characterization of distance matrices of weighted cubic graphs and Peterson graphs

zbMath1489.05061arXiv1901.00360MaRDI QIDQ5078316

Dario Villanis Ziani, Elena Rubei

Publication date: 23 May 2022

Full work available at URL: https://arxiv.org/abs/1901.00360

zbMATH Keywords

distance matricesweighted hypercube graphsweighted Petersen graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40) Signed and weighted graphs (05C22)

Cites Work

• Recognizing treelike \(k\)-dissimilarities
• Families of multiweights and pseudostars
• Weighted graphs with distances in given ranges
• \((0,\lambda)\)-graphs and \(n\)-cubes
• Another characterization of hypercubes
• Reconstructing trees from subtree weights.
• Treelike families of multiweights
• A note on the tree realizability of a distance matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of distance matrices of weighted cubic graphs and Peterson graphs