On the connectivity of p-diamond-free vertex transitive graphs

AbstractLet G be a graph of order n(G), minimum degree δ(G) and connectivity κ(G). We call the graph G maximally connected when κ(G)=δ(G). The graph G is said to be superconnected if every minimum vertex cut isolates a vertex.For an integer p≥1, we define a p-diamond as the graph with p+2 vertices, where two adjacent vertices have exactly p common neighbors, and the graph contains no further edges. Usually, the 1-diamond is triangle and the 2-diamond is diamond. We call a graph p-diamond-free if it contains no p-diamond as a (not necessarily induced) subgraph. A graph is vertex transitive if its automorphism group acts transitively on its vertex set.In this paper, we give some sufficient conditions for vertex transitive graphs to be maximally connected. In addition, superconnected p-diamond-free (1≤p≤3) vertex transitive graphs are characterized