Total Domination in Graphs (e-bok)
Fler böcker inom
Format
E-bok
Filformat
PDF med Adobe-kryptering
Om Adobe-kryptering
PDF-böcker lämpar sig inte för läsning på små skärmar, t ex mobiler.
Nedladdning
Kan laddas ned under 24 månader, dock max 3 gånger.
Språk
Engelska
Utgivningsdatum
2014-07-08
Förlag
Springer New York
ISBN
9781461465256
Total Domination in Graphs (e-bok)

Total Domination in Graphs (e-bok)

E-bok (PDF - DRM), Engelska, 2014-07-08
939
Laddas ned direkt
Läs i vår app för iPhone, iPad och Android
Finns även som
Visa alla 2 format & utgåvor
Total Domination in Graphs gives a clear understanding of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some of the topics featured include the interplay between total domination in graphs and transversals in hypergraphs, and the association with total domination in graphs and diameter-2-critical graphs. Several proofs are included in this text which enables readers to acquaint themselves with a toolbox of proof techniques and ideas with which to attack open problems in the field. This work is an excellent resource for students interested in beginning their research in this field. Additionally, established researchers will find the book valuable to have as it contains the latest developments and open problems.
Visa hela texten

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

  • From Domination to Coloring

    Gary Chartrand, Teresa W Haynes, Michael A Henning, Ping Zhang

    This book is in honor of the 80th birthday of Stephen Hedetniemi. It describes advanced material in graph theory in the areas of domination, coloring, spanning cycles and circuits, and distance that grew out of research topics investigated by Step...

  • Transversals in Linear Uniform Hypergraphs

    Michael A Henning, Anders Yeo

    This book gives the state-of-the-art on transversals in linear uniform hypergraphs. The notion of transversal is fundamental to hypergraph theory and has been studied extensively. Very few articles have discussed bounds on the transversal number f...