Geodesic Convexity in Graphs, 1st Edition

  • Published By:
  • ISBN-10: 1461486998
  • ISBN-13: 9781461486992
  • DDC: 516.3
  • Grade Level Range: College Freshman - College Senior
  • 112 Pages | eBook
  • Original Copyright 2013 | Published/Released June 2014
  • This publication's content originally published in print form: 2013

  • Price:  Sign in for price



​​​​​​​​Geodesic Convexity in Graphs is devoted to the study of the geodesic convexity on finite, simple, connected graphs. The first chapter includes the main definitions and results on graph theory, metric graph theory and graph path convexities. The following chapters focus exclusively on the geodesic convexity, including motivation and background, specific definitions, discussion and examples, results, proofs, exercises and open problems. The main and most st​udied parameters involving geodesic convexity in graphs are both the geodetic and the hull number which are defined as the cardinality of minimum geodetic and hull set, respectively. This text reviews various results, obtained during the last one and a half decade, relating these two  invariants and some others such as convexity number, Steiner number, geodetic iteration number, Helly number, and Caratheodory number to a wide range a contexts, including products, boundary-type vertex sets, and perfect graph families. This monograph can serve as a supplement to a half-semester graduate course in geodesic convexity but is primarily a guide for postgraduates and researchers interested in topics related to metric graph theory and graph convexity theory.  ​

Table of Contents

Front Cover.
Editorial Board.
Title Page.
Copyright Page.
1: Introduction.
2: Invariants.
3: Graph Operations.
4: Boundary Sets.
5: Steiner Trees.
6: Oriented Graphs.
7: Computational Complexity.
Symbol Index.