Abstract
Consider a weighted simple graph G on the vertex set {1,..., n}. For any path p in G, we call ω G (p) the sum of the weights of the edges of the path, and, for any {i, j} ⊂ {1,..., n}, we define the multiset
We establish a criterion for a multisubset of ℝ to be of the form \(\mathcal{D}_{\{ i,j\} } (G)\) for some weighted complete graph G and for some i, j vertices of G.
Besides we establish a criterion for a family
of multi-subsets of ℝ to be of the form
for some weighted complete graph G with vertex set {1,..., n}.
Similar content being viewed by others
References
A. Baldisserri and E. Rubei, On graphlike k-dissimilarity vectors, arXiv:1211.0423, to appear in Ann. Comb.
H-J Bandelt and M. A. Steel, Symmetric matrices representable by weighted trees over a cancellative abelian monoid, SIAM J. Discrete Math., 8(4) (1995), 517–525.
P. Buneman, A note on the metric properties of trees, J. Comb. Theory, Ser. B, 17 (1974), 48–50.
A. Dress, K. Huber and M. Steel, ‘Lassoing’ a phylogenetic tree I: Basic properties, shellings, and covers, J. Math. Biol, 65(1) (2012), 77–105.
A. Dress, K. Huber, A. Lesser and V. Moulton, Hereditarily optimal realizations of consistent metrics, Ann. Comb., 10(1) (2006), 63–76.
A. Dress, K. Huber, J. Koolen, V. Moulton and A. Spillner, Basic phylogenetic combinatorics, Cambridge University Press, Cambridge (2012).
S. L. Hakimi and S.S. Yau, Distance matrix of a graph and its realizabihty, Quart. Appl. Math., 22 (1964), 305–317.
S. Herrmann, K. Huber, V. Moulton and A. Spillner, Recognizing treelike k-dissimilarities, J. Classification, 29(3) (2012), 321–340.
A. Lesser Optimal and Hereditarily Optimal Realization of Metric Spaces, Uppsala Dissertations in Mathematics, 52, 2007, Uppsala, 70 pp.
M. Nei and N. Saitou, The neighbor joining method: a new method for reconstructing phylogenetic trees, Mol. Biol. Evol., 4(4) (1987), 406–425.
L. Pachter and D. Speyer, Reconstructing trees from subtree weights, Appl. Math. Lett., 17(6) (2004), 615–621.
E. Rubei, Sets of double and triple weights of trees, Ann. Comb., 15(4) (2011), 723–734.
E. Rubei, On dissimilarity vectors of general weighted trees, Discrete Math., 312(19) (2012), 2872–2880.
J. M. S. Simoes Pereira, A Note on the Tree Realizability of a distance matrix, J. Combinatorial Theory, 6 (1969), 303–310.
E. D. Stotskii, Embedding of Finite Metrics in graphs, Sib. Math. J., 5 (1964), 1203–1206.
J. A. Studier and K. J. Keppler, A note on the neighbor-joining algorithm of Saitou and Nei, Mol. Biol. Evol., 5(6) (1988), 729–731.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rubei, E. On the weights of simple paths in weighted complete graphs. Indian J Pure Appl Math 44, 511–525 (2013). https://doi.org/10.1007/s13226-013-0027-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13226-013-0027-6