Open Accessl-extra edge connectivity of graphs
Author(s) -
Yalan Li,
Shumin Zhang,
Chengfu Ye
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2010/1/012094
Subject(s) - combinatorics , enhanced data rates for gsm evolution , graph , computer science , mathematics , connectivity , interconnection , connected component , discrete mathematics , computer network , artificial intelligence
When we design an multiprocessor systems of interconnection network, one important question is considering the reliability evaluation of network. For a positive integer l , the l ‐extra edge connectivity λ l ( G ) of a connected graph G , is the minimum number of edges so that when removal the edges from G , then we get a disconnected graph and each component has more than l vertices. In this paper, we get the exact values of l ‐extra edge connectivity. Upper and lower bounds of l ‐extra edge connectivity. Get the extremal results of this connectivity.