Abstract
We give a necessary and sufficient condition for the existence of a quasi-distance matrix where some positive off-diagonal entries have been prescribed. Moreover, we give an algorithm for obtaining such a matrix. We analyze also the case where distances instead of quasi-distances are considered.
References
[1] Agnese Baldisserri and Elena Rubei: Distance matrices of some positive weighted graphs, Australasian J. of Combinatorics 70-2 (2018), 185-201.Search in Google Scholar
[2] A. Dress, K. T. Huber, J. Koolen, V. Moulton and A. Spillner: Basic Phylogenetic Combinatorics, Cambridge University Press, Cambridge, 2012.10.1017/CBO9781139019767Search in Google Scholar
[3] Jeremy P. Spinrad: Efficient Graph Representations, Fields Institute Monographs, American Mathematical Society, 2003.10.1090/fim/019Search in Google Scholar
[4] Leslie Hogben: Handbook of Linear Algebra, Chapman and Hall/CRC Press, 2007.10.1201/9781420010572Search in Google Scholar
[5] Salton N. and M. Nei: The neighbor-joining method: a new method for reconstructing phylogenetic trees, Molecular Biology and Evolution 4-4, (July 1987), 406-425.Search in Google Scholar
[6] J. M. S. Simões-Pereira: Matemática Discreta: Grafos, Redes, Aplicações(in Portuguese), Editora Luz da Vida, Coimbra, Portugal, 2009.Search in Google Scholar
[7] Yulin Zhang, A. Veloso da Costa and J. M. S. Simões-Pereira: The tower matrix, an alternative to deal with distances and quasi-distances, Journal of Multiple-Valued Logic and Soft Computing 32 (2019), 449-454.Search in Google Scholar
© 2018 Yulin Zhang et al., published by De Gruyter
This work is licensed under the Creative Commons Attribution 4.0 International License.
