Problem. Let \Gamma be a nice graph. Show that \Gamma is very connected. In this talk I would like to give three examples of results about the connectivity of a graph that follow by considering its spectrum. There are lots of open problems. Three measures
Volume 9 (1& 2) 1996, pp. 37{ 40
Spectrum and Connectivity of Graphs Technical University Eindhoven, Department of Mathematics, P.O. Box 513, 5600 MB Eindhoven The Netherlands e-mail aeb@win.tue.nl
A.E. Brouwer
Problem. Let? be a nice graph. Show that? is very connected. In this talk I would like to give three examples of results about the connectivity of a graph that follow by considering its spectrum. There are lots of open problems. Three measures of connectivity play a r^le here: o (i) is? connected or not? (ii) (?), the vertex connectivity of?, that is, the minimum number of vertices that one has to remove in order to disconnect?. (iii) t(?), the toughness of?, is de ned as
where S runs over all sets of vertices such that? n S is disconnected, and c(? n S ) is its number of connected components. The graph K0 without vertices is not connected (we have c(K0 )= 0, while c(?)= 1 for connected graphs?) but I shall leave unde ned whether it is disconnected, and hence do not de ne (?) and t(?) when? is complete. 4 For example, for the Petersen graph we nd (?)= 3 and t(?)= 3 . More generally, we clearly have (?) k(?) if k(?) is the (minimal) valency of?. One may also ask about the size of`nonlocal' cut sets. For example, (1) (`unimodality') Is it true that if S is a cut set of?, with separation? n S= A+ B, then min(j?(S )\ Aj; j?(S )\ B j) jS j? (Here?(S ) denotes the set of all vertices adjacent to some vertex of S .) (Jack Koolen remarks that some condition is necessary: for each i, 0 i 17, the Biggs-Smith graph has a cut set S of size 17 such that j?(S )\ Aj= 17+ i, j?(S )\ B j= 34? i.) (2) Show that jS j is substantially larger than k when S is nonlocal (say, given a lower bound on the size or the minimum valency of each component of? n S ).
j min c(?S j S ) S n
37

Spectrum and connectivit... 暂无评价 4页 免费 CONNECTIVITY AND PLAN... ... Conjectures on index and algebraic connectivity of graphs 化学指数化学指数...
Connectivity of Planar G... 暂无评价 13页 免费 Spectrum and connectivit....The minimal connected generalized knight's graphs are shown to be planar or...
Spectrum and connectivit... 暂无评价 4页 免费 Connectivity and Transpo......93–105 (2001) Connectivity of Planar Graphs H. de Fraysseix P. Ossona ...
Connectivity of Planar G... 暂无评价 13页 免费 Spectrum and connectivit....Explicit construction algorithms exist for Ramanujan graphs that create regular ...
Connectivity and Transpo... 暂无评价 8页 2.00元 Spectrum and connectivit...ection positivity, rank connectivity, and homomorphism of graphs ? ? ? ? ...
Spectrum and connectivit... 暂无评价 4页 免费 Connectivity and Transpo......93–105 (2001) Connectivity of Planar Graphs H. de Fraysseix P. Ossona ...
3-restricted connectivity of graphs with given girth_专业资料。维普资讯 http://www.cqvip.com Ap.MahJp1t..Chis neeUni v 20,33:5-5 082()3138 3rs...
[5] G. Chartrand and M. J. Stewart, The connectivity of line graphs, Ann., 182 (1969) 170-174. Math. [6] T. Hamada, T. Nonaka, and I. ...
The m-connectivity index of graphs Hao Li? Mei Lu? ? Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China (Received November ...
Connectivity and Transportation Description of Graphs_专业资料 暂无评价
热门文档