Tools

LEADER 03736cam a22005297i 4500

001 ssj0001010500;

003 WaSeSS;

005 20240412080346.0;

006 m d ;

007 cr n ;

008 130729t20132013nyua sb 001 0 eng d;

010 a| 2013946414;

020 a| 9781461486985 (pbk. : alk. paper);

020 a| 146148698X (pbk. : alk. paper);

035 a| (WaSeSS)ssj0001010500;

042 a| lccopycat;

049 a| EREEa| NEHH;

050 00 a| QA649b| .P355 2013;

050 14 a| QA166b| .P45 2013;

082 04 a| 516.3/622| 23;

100 1 a| Pelayo, Ignacio M.?| UNAUTHORIZED;

245 10 a| Geodesic convexity in graphsh| [electronic resource] /c| Ignacio M. Pelayo.;

260 a| New York :b| Springer,c| [2013];

300 a| viii, 112 pages :b| illustrations ;c| 24 cm.;

490 1 a| SpringerBriefs in mathematics,x| 2191-8198;

504 a| Includes bibliographical references (pages 99-105) and index.;

505 0 a| 1. Introduction -- 2. Invariants -- 3. Graph operations -- 4. Boundary sets -- 5. Steiner trees -- 6. Oriented graphs -- 7. Computational complexity.;

506 a| Available only to authorized users.;

520 3 a| 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 --c| Publisher's website.;

538 a| Mode of access: World Wide Web;

650 0 a| Geodesics (Mathematics)=| ^A283230;

650 0 a| Graph theory.=| ^A31040;

650 0 a| Convex sets.=| ^A84798;

655 0 a| Electronic books.=| ^A491897;

830 0 a| SpringerBriefs in mathematics.x| 2191-8198=| ^A1256596;

856 40 z| Full text available from Springer Booksu| https://go.openathens.net/redirector/ecu.edu?url=https%3A%2F%2Flink.springer.com%2F10.1007%2F978-1-4614-8699-2;

856 40 z| Full text available from Springer Nature - Springer Mathematics and Statistics eBooks 2013 English Internationalu| https://go.openathens.net/redirector/ecu.edu?url=https%3A%2F%2Flink.springer.com%2F10.1007%2F978-1-4614-8699-2;

947 a| (OCoLC)ocn857973202;

949 a| CLICK ON WEB ADDRESSw| ASISh| JOYNER188;

949 a| CLICK ON WEB ADDRESSw| ASISh| HSL77;

949 a| CLICK ON WEB ADDRESSw| ASISh| JMUSIC60;

596 a| 1 3 4;

998 a| 4094241;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4094241-1001l| JNETm| JOYNERr| Ys| Yt| JNESSBKu| 1/1/2016x| EBOOKz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4094241-2001l| HSLELECm| HSLr| Ys| Yt| HEBKu| 1/1/2016x| EBOOKz| HERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4094241-3001l| MNETm| JMUSICr| Ys| Yt| MNESSBKu| 1/1/2016x| EBOOKz| JERESOURCE;

Geodesic convexity in graphs / Ignacio M. Pelayo.

Author/creator	Pelayo, Ignacio M.
Format	Electronic
Publication Info	New York : Springer, [2013]
Description	viii, 112 pages : illustrations ; 24 cm.
Supplemental Content	Full text available from Springer Books
Supplemental Content	Full text available from Springer Nature - Springer Mathematics and Statistics eBooks 2013 English International
Subjects	Geodesics (Mathematics) Graph theory. Convex sets.

Series	SpringerBriefs in mathematics, 2191-8198 SpringerBriefs in mathematics. 2191-8198 ^A1256596
Contents	1. Introduction -- 2. Invariants -- 3. Graph operations -- 4. Boundary sets -- 5. Steiner trees -- 6. Oriented graphs -- 7. Computational complexity.
Summary	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 -- Publisher's website.
Bibliography note	Includes bibliographical references (pages 99-105) and index.
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	2013946414
ISBN	9781461486985 (pbk. : alk. paper)
ISBN	146148698X (pbk. : alk. paper)

Geodesic convexity in graphs / Ignacio M. Pelayo.

Click here for more information about this title