000			03471cam a2200409Ki 4500
001			ocn855022869
003			OCoLC
005			20240726105401.0
008			130805s2013 nyua ob 001 0 eng d
040			_aNT _beng _epn _erda _cNT _dYDXCP _dIDEBK _dCDX _dUMI _dCOO _dE7B _dOCLCO _dEBLCP _dOCLCA _dDEBSZ _dOCLCQ _dOCLCF _dOCLCQ
020			_a9781107249813 _q((electronic)l(electronic)ctronic)
020			_a9781107240933
020			_a9781107247321
050	0	4	_aQA166 _b.T675 2013
049			_aMAIN
245	1	0	_aTopics in structural graph theory /edited by Lowell W. Beineke, Robin J. Wilson.
260			_aNew York : _bCambridge University Press, _c(c)2013.
300			_a1 online resource (xiv, 327 pages) : _billustrations.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_adata file _2rda
490	1		_aEncyclopedia of mathematics and its applications ; _v147
520	0		_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"-- _cProvided by publisher.
504			_a2
505	0	0	_aPreliminaries / _rLowell W. Beineke and Robin J. Wilson -- _tMenger's theorem / _rOrtrud O. Oellermann -- _tMaximally connected graphs / _rDirk Meierling and Lutz Volkmann -- _tMinimal connectivity / _rMatthias Kriesell -- _tContractions of k-connected graphs / _rKiyoshi Ando -- _tConnectivity and cycles / _rR.J. Faudree -- _tH-linked graphs / _rMichael Ferrara and Ronald J. Gould -- _tTree-width and graph minors / _rDieter Rautenbach and Bruce Reed -- _tToughness and binding numbers / _rIan Anderson -- _tGraph fragmentability / _rKeith Edwards and Graham Farr -- _tThe phase transition in random graphs / _rBéla Bollobás and Oliver Riordan -- _tNetwork reliability and synthesis / _rF.T. Boesch, A. Satyanarayana and C.L. Suffel -- _tConnectivity algorithms / _rAbdol-Hossein Esfahanian -- _tUsing graphs to find the best block designs / _rR.A. Bailey and Peter J. Cameron.
530			_a2 _ub
650		0	_aGraph theory _xData processing.
650		4	_aGraph theory _xData processing.
655		1	_aElectronic Books.
700	1		_aBeineke, Lowell W.
700	1		_aWilson, Robin J.
856	4	0	_uhttps://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=574827&site=eds-live&custid=s3260518 _zClick to access digital title | log in using your CIU ID number and my.ciu.edu password
942			_cOB _D _eEB _hQA _m(c)2013 _QOL _R _x _8NFIC _2LOC
994			_a92 _bNT
999			_c98620 _d98620
902			_a1 _bCynthia Snell _c1 _dCynthia Snell