Tolerance graphs

By:

Golumbic, Martin Charles

Contributor(s):

Trenk, Ann N

Material type: Book

BookSeries: Cambridge studies in advanced mathematics ; 89Publication details: Cambridge: Cambridge University Press, 2004.Description: xii, 265 p. : ill. ; hb, 24 cmISBN:

9780521827584

Subject(s):

DDC classification:

511.5 GOL

Summary: The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Date due	Barcode
Books	IIT Gandhinagar General Stacks	General	511.5 GOL (Browse shelf(Opens below))	1	Available		030178

Browsing IIT Gandhinagar shelves, Shelving location: General Stacks, Collection: General Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511.5 DEO Graph theory with applications to engineering and computer science	511.5 DEO Graph theory with applications to engineering and computer science	511.5 DEO Graph theory with applications to engineering and computer science	511.5 GOL Tolerance graphs	511.5 HOF Random graphs and complex networks; v. 1	511.5 TER Zeta functions of graphs: a stroll through the garden	511.6 BAI Association schemes: designed experiments, algebra and combinatorics	Next

Includes bibliographical references (p. 253-259) and indexes.

The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.

There are no comments on this title.

to post a comment.