Geodesic Convexity in Graphs - Springerbriefs in Mathematics - Ignacio M. Pelayo - Grāmatas - Springer-Verlag New York Inc. - 9781461486985 - 2013. gada 6. septembris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Geodesic Convexity in Graphs - Springerbriefs in Mathematics 2013 edition


Saņemt e-pastu, kad prece būs pieejama
Do you have a profile? Pierakstīties
Saņemiet paziņojumus par jauniem Ignacio M. Pelayo izdevumiem
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

★★★★★★??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.  ?


120 pages, 41 black & white illustrations, biography

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2013. gada 6. septembris
ISBN13 9781461486985
Izdevēji Springer-Verlag New York Inc.
Lapas 120
Izmēri 155 × 235 × 7 mm   ·   195 g
Valoda Angļu  

Vairāk no tā paša izdevēja