Geodesic Convexity in Graphs

Beschreibung

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 studied 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.  
Geodesic Convexity in Graphs ?is a self-contained monograph which is devoted to geodesic convexity on finite, simply connected graphs Includes specific definitions, discussion and examples, results, proofs, exercises and open problems ?on geodesic convexity Examines results obtained during the past 15 years, relating cardinality of minimum geodetic and hull sets Includes supplementary material: sn.pub/extras

Autor*in

Ignacio M. Pelayo

Themen in »Geodesic Convexity in Graphs«

Convex hull Geodesic convexity Geodetic closure Graph convexity Hull set Metric graph theory partial differential equations

Stimmen zu »Geodesic Convexity in Graphs«

Details

Link teilen