LEADER 03356oam  2200505   450 
001 9910438028203321
005 20190911103512.0
010   $a1-4614-8699-8
024 7 $a10.1007/978-1-4614-8699-2
035   $a(OCoLC)857765887
035   $a(MiFhGG)GVRL6YFE
035   $a(EXLCZ)993710000000019062
100   $a20130729d2013      uy             0
101 0 $aeng
135   $aurun|---uuuua
181   $ctxt
182   $cc
183   $acr
200 10$aGeodesic convexity in graphs /$fIgnacio M. Pelayo
205   $a1st ed. 2013.
210  1$aNew York :$cSpringer,$d2013.
215   $a1 online resource (viii, 112 pages) $cillustrations
225 1 $aSpringerBriefs in Mathematics,$x2191-8198
300   $a"ISSN: 2191-8198."
311   $a1-4614-8698-X 
320   $aIncludes bibliographical references and index.
327   $aPreface; Contents; Chapter1 Introduction; 1.1 Graph Theory; 1.2 Metric Graph Theory; 1.3 Convexity Spaces; 1.4 Graph Convexities; Chapter2 Invariants; 2.1 Geodetic Closure and Convex Hull; 2.2 Geodetic and Hull Numbers; 2.3 Monophonic and m-Hull Numbers; 2.4 Convexity Number; 2.5 Forcing Geodomination; 2.6 Closed Geodomination; 2.7 Geodetic Domination; 2.8 k-Geodomination; 2.9 Edge Geodomination; 2.10 Classical Parameters; Chapter3 Graph Operations; 3.1 Cartesian Product; 3.2 Strong Product; 3.3 Lexicographic Product; 3.4 Join; 3.5 Corona Product; Chapter4 Boundary Sets
327   $aChapter5 Steiner TreesChapter6 Oriented Graphs; Chapter7 Computational Complexity; Glossary; References; Index; Symbol Index
330   $aGeodesic 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.  .
410  0$aSpringerBriefs in mathematics.
606   $aGeodesics (Mathematics)
606   $aGraph theory
606   $aConvex sets
615  0$aGeodesics (Mathematics)
615  0$aGraph theory.
615  0$aConvex sets.
676   $a511.5
676   $a516.3/62
700   $aPelayo$b Ignacio M$4aut$4http://id.loc.gov/vocabulary/relators/aut$01060076
801  0$bMiFhGG
801  1$bMiFhGG
906   $aBOOK
912   $a9910438028203321
996   $aGeodesic Convexity in Graphs$92510958
997   $aUNINA