Super restricted edge connectivity of regular edge-transitive graphs
نویسندگان
چکیده
منابع مشابه
Restricted Edge Connectivity of Regular Graphs
An edge cut that separates the connected graph into components with order at least two is restricted edge cut. The cardinality of minimum restricted edge cut is restricted edge connectivity. Denote byλ′ ( G) the restricted edge connectivity , then λ′( G) ≤ξ( G) where ξ( G) is the minimum edge degree. G is called maximal restricted edge connected if the equality in the previous inequality holds....
متن کاملStrongly regular edge-transitive graphs
In this paper, we examine the structure of vertexand edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using the Classification of Finite Simple Groups) that no graph in this family has a holomorphic simple automorphism group. We also find some constraints on the parame...
متن کامل2-restricted Edge Connectivity of Vertex-transitive Graphs
The 2-restricted edge-connectivity λ′′ of a graph G is defined to be the minimum cardinality |S| of a set S of edges such thatG−S is disconnected and is of minimum degree at least two. It is known that λ′′ ≤ g(k − 2) for any connected k-regular graph G of girth g other than K4, K5 and K3,3, where k ≥ 3. In this paper, we prove the following result: For a connected vertex-transitive graph of ord...
متن کاملProduct of normal edge-transitive Cayley graphs
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
متن کاملEdge-connectivity and super edge-connectivity of P2-path graphs
For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, (P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is superif each minimum edge cut is trivial, and it is optimum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.12.004