Title: Restricted Edge Connectivity of Alternating Group Graphs
Abstract: In this research, we study restricted edge-cut sets and the related restricted-edge connectivity in certain alternating group graphs. Let S be a subset of the edge set of a graph G and m be a positive integer. The set S is a restricted edge-cut of order m if G-S is disconnected with each component consisting of at least m vertices. The m-restricted edge connectivity of G is the minimum cardinality of all restricted edge-cuts of order m, if it exists. An n-dimensional alternating group graph is constructed from the alternating group of degree n. We give formulas for the m-restricted edge connectivity of G for small values of m.
This article was gathered automatically by our news bot. We help YouTubers by driving traffic to them for free. The featured image in this article is the thumbnail of the embedded video. Thank you for visiting Win Big Sports Network and wbsnsports.com. For more sports, news, and entertainment, follow us on Twitter @WBSNsports or like our page on Facebook.
#Sports #Video #Highlights
