東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Topics in structural graph theory /

Beineke, Lowell W.

FindBook

Google Book

Amazon

博客來

Topics in structural graph theory /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Topics in structural graph theory // edited by Lowell W. Beineke, Robin J. Wilson ; academic consultant, Ortrud R. Oellermann.
其他作者:	Beineke, Lowell W.
出版者:	New York :Cambridge University Press, : 2013.,
面頁冊數:	xiv, 327 p. :ill. ;24 cm.
標題:	Graph theory - Data processing. -
電子資源:	http://assets.cambridge.org/97805218/02314/cover/9780521802314.jpg
ISBN:	9780521802314 (hbk.) :

Topics in structural graph theory /
Topics in structural graph theory /edited by Lowell W. Beineke, Robin J. Wilson ; academic consultant, Ortrud R. Oellermann. - New York :Cambridge University Press,2013. - xiv, 327 p. :ill. ;24 cm. - Encyclopedia of mathematics and its applications ;147.

Includes bibliographical references and index.

Preliminaries Lowell /W. Beineke and Robin J. Wilson --

"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"--

ISBN: 9780521802314 (hbk.) :US95.00

LCCN: 2012022109Subjects--Topical Terms:

655277
Graph theory
--Data processing.

LC Class. No.: QA166 / .T645 2013

Dewey Class. No.: 511/.5

Topics in structural graph theory /
LDR:02960cam a2200301 a 450 001 1875376
005 20131223133435.0
008 130828s2013 nyua b 001 0 eng
010 $a 2012022109
020 $a 9780521802314 (hbk.) : $c US95.00
020 $a 0521802318 (hbk.)
020 $a 9781107249813 (ebk.)
020 $a 1107249813 (ebk.)
020 $a 9781107240933 (ebk.)
020 $a 110724093X (ebk.)
020 $a 9781107248151 (ebk.)
020 $a 1107248159 (ebk.)
035 $a AS-BW-102-N-03
040 $a DLC $c DLC $d DLC
050 0 0 $a QA166 $b .T645 2013
082 0 0 $a 511/.5 $2 23
245 1 0 $a Topics in structural graph theory / $c edited by Lowell W. Beineke, Robin J. Wilson ; academic consultant, Ortrud R. Oellermann.
260 # $a New York : $b Cambridge University Press, $c 2013.
300 $a xiv, 327 p. : $b ill. ; $c 24 cm.
490 1 0 $a Encyclopedia of mathematics and its applications ; $v 147
504 $a Includes bibliographical references and index.
505 0 # $t Preliminaries Lowell / $r W. Beineke and Robin J. Wilson -- $t Menger's theorem / $r Ortrud O. Oellermann -- $t Maximal connectivity / $r Dirk Meierling and Lutz Volkmann -- $t Minimal connectivity / $r Matthias Kriesell -- $t Contractions of k-connected graphs / $r Kiyoshi Ando -- $t Connectivity and cycles / $r R. J. Faudree -- $t H-linked graphs / $r Michael Ferrara and Ronald J. Gould -- $t Tree-width and graph minors / $r Dieter Rautenbach and Bruce Reed -- $t Toughness and binding number / $r Ian Anderson -- $t Graph fragmentability / $r Keith Edwards and Graham Farr -- $t The phase transition in random graphs / $r Bela Bollobás and Oliver Riordan -- $t Network reliability and synthesis / $r F. T. Boesch, A. Satyanarayana and C. L. Suffel -- $t Connectivity algorithms / $r Abdol-Hossein Esfahanian -- $t Using graphs to find the best block designs / $r R. A. Bailey and Peter J. Cameron.
520 # $a "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"-- $c Provided by publisher.
650 # 0 $a Graph theory $x Data processing. $3 655277
700 1 # $a Beineke, Lowell W. $3 596198
700 1 # $a Wilson, Robin J. $3 596199
856 4 2 $3 Cover image $u http://assets.cambridge.org/97805218/02314/cover/9780521802314.jpg