Atnaujinkite slapukų nuostatas

El. knyga: Generalized Connectivity of Graphs

,
  • Formatas: PDF+DRM
  • Serija: SpringerBriefs in Mathematics
  • Išleidimo metai: 30-Jun-2016
  • Leidėjas: Springer International Publishing AG
  • Kalba: eng
  • ISBN-13: 9783319338286
Kitos knygos pagal šią temą:
Generalized Connectivity of GraphsDidesnis paveikslėlis
  • Formatas: PDF+DRM
  • Serija: SpringerBriefs in Mathematics
  • Išleidimo metai: 30-Jun-2016
  • Leidėjas: Springer International Publishing AG
  • Kalba: eng
  • ISBN-13: 9783319338286
Kitos knygos pagal šią temą:

DRM apribojimai

  • Kopijuoti:

    neleidžiama

  • Spausdinti:

    neleidžiama

  • El. knygos naudojimas:

    Skaitmeninių teisių valdymas (DRM)
    Leidykla pateikė šią knygą šifruota forma, o tai reiškia, kad norint ją atrakinti ir perskaityti reikia įdiegti nemokamą programinę įrangą. Norint skaityti šią el. knygą, turite susikurti Adobe ID . Daugiau informacijos  čia. El. knygą galima atsisiųsti į 6 įrenginius (vienas vartotojas su tuo pačiu Adobe ID).

    Reikalinga programinė įranga
    Norint skaityti šią el. knygą mobiliajame įrenginyje (telefone ar planšetiniame kompiuteryje), turite įdiegti šią nemokamą programėlę: PocketBook Reader (iOS / Android)

    Norint skaityti šią el. knygą asmeniniame arba „Mac“ kompiuteryje, Jums reikalinga  Adobe Digital Editions “ (tai nemokama programa, specialiai sukurta el. knygoms. Tai nėra tas pats, kas „Adobe Reader“, kurią tikriausiai jau turite savo kompiuteryje.)

    Negalite skaityti šios el. knygos naudodami „Amazon Kindle“.

Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity.This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.

1. Introduction.- 2. Results for some graph classes.- 3. Algorithm and complexity.- 4. Sharp bounds of the generalized (edge-) connectivity.- 5. Graphs with given generalized connectivity.- 6. Nordhaus-Gaddum-type results.- 7. Results for graph products.- 8. Maximum generalized local connectivity.- 9. Generalized connectivity for random graphs.- Bibliography.- Index.

Recenzijos

The monograph under review is devoted to the exposition of results about the generalized connectivity and generalized edge-connectivity of graphs. Reading it does not require significant background in the relevant fields, as most concepts are introduced and defined . I would recommend it for a researcher, graduate student, or senior undergraduate student who has an interest in pursuing research on this subject. (Joy M. W. Morris, Mathematical Reviews, April, 2017)









This book is a concise and elegant piece of work on an old yet new topic of combinatorics. The book may be of interest for those who work with communication networks, graph theory and combinatorial optimizations in general. (Yilun Shang, zbMATH 1346.05001, 2016)

1. Introduction.-
2. Results for some graph classes.-
3. Algorithm and
complexity.-
4. Sharp bounds of the generalized (edge-) connectivity.-
5.
Graphs with given generalized connectivity.-
6. Nordhaus-Gaddum-type
results.-
7. Results for graph products.-
8. Maximum generalized local
connectivity.-
9. Generalized connectivity for random graphs.- Bibliography.
Index. 
Daugiau apie elektronines knygas Daugiau apie elektronines knygas
Pastovi nuoroda: https://www.kriso.lt/db/97833193382862e.html
Raktažodžiai: