Distance in Graphs

Wayne Goddard () and Ortrud R. Oellermann
Additional contact information
Wayne Goddard: Clemson University, School of Computing and Department of Mathematical Sciences

Chapter Chapter 3 in Structural Analysis of Complex Networks, 2011, pp 49-72 from Springer

Abstract: Abstract The distance between two vertices is the basis of the definition of several graph parameters including diameter, radius, average distance and metric dimension. These invariants are examined, especially how they relate to one another and to other graph invariants and their behaviour in certain graph classes. We also discuss characterizations of graph classes described in terms of distance or shortest paths. Finally, generalizations are considered.

Keywords: Graph; Distance; Diameter; Radius; Steiner distance (search for similar items in EconPapers)
Date: 2011
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-0-8176-4789-6_3

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

DOI: 10.1007/978-0-8176-4789-6_3

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 ().