Geodesic Convexity in Graphs (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
112
Utgivningsdatum
2013-09-06
Upplaga
2013 ed.
Förlag
Springer-Verlag New York Inc.
Illustrationer
41 Illustrations, black and white; VIII, 112 p. 41 illus.
Dimensioner
234 x 156 x 7 mm
Vikt
182 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9781461486985
Geodesic Convexity in Graphs (häftad)

Geodesic Convexity in Graphs

Häftad Engelska, 2013-09-06
599
  • Skickas inom 3-6 vardagar.
  • Gratis frakt inom Sverige över 159 kr för privatpersoner.
Finns även som
Visa alla 1 format & utgåvor
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.
Visa hela texten

Passar bra ihop

  1. Geodesic Convexity in Graphs
  2. +
  3. Geodesic Flows

De som köpt den här boken har ofta också köpt Geodesic Flows av Gabriel P Paternain (inbunden).

Köp båda 2 för 1888 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Innehållsförteckning

1. Introduction. -2. Invariants. -3. Graph Operations. -4. Boundary Sets. -5. Steiner trees. -6. Oriented graphs. -7. Computational complexity. -References.-Glossary.-Index.-Symbol Index.