Abstract
A graph is a pair G = (V, E), where V is a set, called the set of vertices of the graph G, and E is a set of unordered pairs of vertices, called the edges of the graph G. A directed graph (or digraph) is a pair D = (V, E), where V is a set, called the set of vertices of the digraph D, and E is a set of ordered pairs of vertices, called arcs of the digraph D.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aichholzer O., Aurenhammer F. and Hurtado F. Edge Operations on Non-crossing Spanning Trees, Proc. 16-th European Workshop on Computational Geometry CG’2000, pp. 121–125, 2000.
Buckley F. and Harary F. Distance in Graphs, Redwood City, CA: Addison-Wesley, 1990.
Cheng Y.C. and Lu S.Y. Waveform Correlation by Tree Matching, IEEE Trans. Pattern Anal. Machine Intell., Vol. 7, pp. 299–305, 1985.
Chepoi V. and Fichet B. A Note on Circular Decomposable Metrics, Geom. Dedicata, Vol. 69, pp. 237–240, 1998.
Coifman R.R., Lafon S., A.B., Maggioni M., Nadler B., Warner F., Zucker S.W. Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps, Proc. of the National Academy of Sciences, Vol. 102, No. 21, pp. 7426–7431, 2005.
Critchlow D.E., Pearl D.K. and Qian C. The Triples Distance for Rooted Bifurcating Phylogenetic Trees, Syst. Biology, Vol. 45, pp. 323–334, 1996.
Deza M.M. and Laurent M. Geometry of Cuts and Metrics, Springer, 1997.
Estabrook G.F., McMorris F.R. and Meacham C.A. Comparison of Undirected Phylogenetic Trees Based on Subtrees of Four Evolutionary Units, Syst. Zool, Vol. 34, pp. 193–200, 1985.
Jiang T., Wang L. and Zhang K. Alignment of Trees – an Alternative to Tree Edit, in Combinatorial Pattern Matching, Lecture Notes in Comp. Science, Vol. 807, Crochemore M. and Gusfield D. (eds.), Springer-Verlag, 1994.
Mak King-Tim and Morton A.J. Distances between Traveling Salesman Tours, Discrete Appl. Math., Vol. 58, pp. 281–291, 1995.
McCanna J.E. Multiply-sure Distances in Graphs, Congressus Numerantium, Vol. 97, pp. 71–81, 1997.
Mucherino A., Lavor C., Liberti L. and Maculan N. (eds.) Distance Geometry, Springer, 2013.
Selkow S.M. The Tree-to-tree Editing Problem, Inform. Process. Lett., Vol. 6-6, pp. 184–186, 1977.
Tai K.-C. The Tree-to-tree Correction Problem, J. of the Association for Comp. Machinery, Vol. 26, pp. 422–433, 1979.
Zelinka B. On a Certain Distance between Isomorphism Classes of Graphs, Casopus. Pest. Mat., Vol. 100, pp. 371–373, 1975.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Deza, M.M., Deza, E. (2016). Distances in Graph Theory. In: Encyclopedia of Distances. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-52844-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-662-52844-0_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-52843-3
Online ISBN: 978-3-662-52844-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)