Topics in structural graph theory /edited by Lowell W. Beineke, Robin J. Wilson.

Contributor(s):

Material type: Text

text

Media type:

computer

Carrier type:

online resource

ISBN:

9781107249813
9781107240933
9781107247321

Subject(s):

Genre/Form:

Electronic Books.

LOC classification:

QA166 .T675 2013

Online resources:

Click to access digital title | log in using your CIU ID number and my.ciu.edu password

Available additional physical forms:

Contents:

Lowell W. Beineke and Robin J. Wilson -- Menger's theorem / Ortrud O. Oellermann -- Maximally connected graphs / Dirk Meierling and Lutz Volkmann -- Minimal connectivity / Matthias Kriesell -- Contractions of k-connected graphs / Kiyoshi Ando -- Connectivity and cycles / R.J. Faudree -- H-linked graphs / Michael Ferrara and Ronald J. Gould -- Tree-width and graph minors / Dieter Rautenbach and Bruce Reed -- Toughness and binding numbers / Ian Anderson -- Graph fragmentability / Keith Edwards and Graham Farr -- The phase transition in random graphs / Béla Bollobás and Oliver Riordan -- Network reliability and synthesis / F.T. Boesch, A. Satyanarayana and C.L. Suffel -- Connectivity algorithms / Abdol-Hossein Esfahanian -- Using graphs to find the best block designs / R.A. Bailey and Peter J. Cameron.

Subject: "The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various aspects of graph theory and vice versa. It has links with other areas of mathematics, such as design theory and is increasingly used in such areas as computer networks where connectivity algorithms are an important feature. Although other books cover parts of this material, none has a similarly wide scope. Ortrud R. Oellermann (Winnipeg), internationally recognised for her substantial contributions to structural graph theory, acted as academic consultant for this volume, helping shape its coverage of key topics. The result is a collection of thirteen expository chapters, each written by acknowledged experts. These contributions have been carefully edited to enhance readability and to standardise the chapter structure, terminology and notation throughout. An introductory chapter details the background material in graph theory and network flows and each chapter concludes with an extensive list of references"--

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	URL	Status	Date due	Barcode
Online Book (LOGIN USING YOUR MY CIU LOGIN AND PASSWORD)	G. Allen Fleece Library ONLINE	Non-fiction	QA166 (Browse shelf(Opens below))	Link to resource	Available		ocn855022869

"The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various aspects of graph theory and vice versa. It has links with other areas of mathematics, such as design theory and is increasingly used in such areas as computer networks where connectivity algorithms are an important feature. Although other books cover parts of this material, none has a similarly wide scope. Ortrud R. Oellermann (Winnipeg), internationally recognised for her substantial contributions to structural graph theory, acted as academic consultant for this volume, helping shape its coverage of key topics. The result is a collection of thirteen expository chapters, each written by acknowledged experts. These contributions have been carefully edited to enhance readability and to standardise the chapter structure, terminology and notation throughout. An introductory chapter details the background material in graph theory and network flows and each chapter concludes with an extensive list of references"--

Includes bibliographies and index.

Preliminaries / Lowell W. Beineke and Robin J. Wilson -- Menger's theorem / Ortrud O. Oellermann -- Maximally connected graphs / Dirk Meierling and Lutz Volkmann -- Minimal connectivity / Matthias Kriesell -- Contractions of k-connected graphs / Kiyoshi Ando -- Connectivity and cycles / R.J. Faudree -- H-linked graphs / Michael Ferrara and Ronald J. Gould -- Tree-width and graph minors / Dieter Rautenbach and Bruce Reed -- Toughness and binding numbers / Ian Anderson -- Graph fragmentability / Keith Edwards and Graham Farr -- The phase transition in random graphs / Béla Bollobás and Oliver Riordan -- Network reliability and synthesis / F.T. Boesch, A. Satyanarayana and C.L. Suffel -- Connectivity algorithms / Abdol-Hossein Esfahanian -- Using graphs to find the best block designs / R.A. Bailey and Peter J. Cameron.

https://lib.ciu.edu/copyright-request-form

There are no comments on this title.

to post a comment.