On graphlike k-dissimilarity vectors

DOI10.1007/S00026-014-0228-7zbMATH Open1297.05050arXiv1211.0423OpenAlexW2051261273MaRDI QIDQ404530FDOQ404530

Authors: Agnese Baldisserri, Elena Rubei 

Publication date: 4 September 2014

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: Let {cal G}=(G,w) be a positive-weighted simple finite graph, that is, let G be a simple finite graph endowed with a function w from the set of the edges of G to the set of the positive real numbers. For any subgraph G' of G, we define w(G') to be the sum of the weights of the edges of G'. For any i_1,..., i_k vertices of G, let D_{{i_1,.... i_k}}({cal G}) be the minimum of the weights of the subgraphs of G connecting i_1,..., i_k. The D_{{i_1,.... i_k}}({cal G}) are called k-weights of {cal G}. Given a family of positive real numbers parametrized by the k-subsets of {1,..., n}, {D_I}_{I k-subset of {1,...,n}}, we can wonder when there exist a weighted graph {cal G} (or a weighted tree) and an n-subset {1,..., n} of the set of its vertices such that D_I({cal G}) =D_I for any I k-subset of {1,...,n}. In this paper we study this problem in the case k=n-1.

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

Recommendations

• On dissimilarity vectors of general weighted trees
• A characterization of dissimilarity families of trees
• Recognizing treelike \(k\)-dissimilarities
• Weighted graphs with distances in given ranges
• Treelike families of multiweights

zbMATH Keywords

weighted graphsdissimilarity families

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Signed and weighted graphs (05C22)

Cites Work

• A note on the metric properties of trees
• A note on the tree realizability of a distance matrix
• Reconstructing trees from subtree weights.
• Recognizing treelike \(k\)-dissimilarities
• Sets of double and triple weights of trees
• Tropical mathematics
• On dissimilarity vectors of general weighted trees
• Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid
• The distance matrix of a graph and its tree realization
• Distance matrix of a graph and its realizability
• Title not available (Why is that?)

Cited In (11)

• Treelike families of multiweights
• Recognizing treelike \(k\)-dissimilarities
• A new dissimilarity measure for comparing labeled graphs
• Families of multiweights and pseudostars
• On dissimilarity vectors of general weighted trees
• The split decomposition of a \(k\)-dissimilarity map
• Title not available (Why is that?)
• Weighted graphs with distances in given ranges
• Moduli space of families of positive \((n - 1)\)-weights
• A characterization of dissimilarity families of trees
• On the weights of simple paths in weighted complete graphs

This page was built for publication: On graphlike \(k\)-dissimilarity vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404530)