Distances in Graph Theory

Michel Marie Deza and Elena Deza
Additional contact information
Michel Marie Deza: Ecole Normale Supérieure
Elena Deza: Moscow State Pedagogical University

Chapter Chapter 15 in Encyclopedia of Distances, 2014, pp 275-307 from Springer

Abstract: 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.

Keywords: Connected Graph; Edit Distance; Editing Operation; Block Graph; Common Subgraph (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-44342-2_15

Ordering information: This item can be ordered from
http://www.springer.com/9783662443422

DOI: 10.1007/978-3-662-44342-2_15

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().