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
1. The connectivity of strongly regular graphs Theorem 1.1. (Brouwer& Mesner 4]) Let? be strongly regular of va-
lency k. Then (?)= k, and the only cut sets of size k are the point neighbourhoods.
The weaker result that for strongly regular graphs the edge-connectivity is at least the valency, was shown ten years earlier by Plesnik 10]. Open problems are for example: (3) Prove the above result for distance-regular graphs. (4) Let? be strongly regular with parameters (v; k;; ), and let S be a disconnecting set not containing any point neighbourhood?(x). Show that jS j 2k? 2? . (5) Let S be a disconnecting set such that jS\?(x)j k for some xed, 0<< 1, and all vertices x of?. Prove a superlinear (in k) lower bound for jS j. Godsil 7] conjectures that for any graph that is a colour class in an association scheme, the edge-connectivity equals the degree, and I conjecture the same for the vertex-connectivity. Partial results: Fiedler 6] shows that the vertex-connectivity of a graph is at least k? 2, where k is the degree and 2 the second largest eigenvalue. Lovasz 9], Problem 12.14, proves that the edge-connectivity of a vertextransit
ive graph is at least its degree. An old result says that the vertexconnectivity of a vertex-transitive graph is at least 2(k+ 1)=3, where the extreme case is the clique extension of a circuit. Brouwer& Mulder 5] showed (?)= k for graphs with the property that any two distinct vertices have either 0 or 2 common neighbours. This settles (3) in the case 2 f0; 2g,= 2. 2. The connectedness of generic pieces of generalized polygons Theorem 2.1. (Brouwer 2]) Let? be the point graph or the ag graph of
a nite generalized polygon. Then the subgraph of? induced on the set of all vertices far away from (`in general position w.r.t.') a point or ag is connected, except in the cases G2 (2), 2 F4 (2) and (for the ag graph) B2 (2), G2 (3). A similar result holds more generally for the complement of a geometric hyperplane.
Open problems: (6) Generalize this to near polygons. (7) Generalize this to distance-regular graphs. It is very easy to see that in a strongly regular graph the subgraph on the vertices far away from a point is connected (except when the graph is complete multipartite). 38
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_专业资料 暂无评价
热门文档