If a communication network N with n stations has every station linked with at least [n/2] other stations, then the edge-connectivity of N equals its minimum degree. Also, in general, this limitation is stated to be the best possibility, as was proved by Chartrand in 1966. A more developed notion of edge-connectivity is introduced, which is called k-component order edge connectivity. It is the minimum number of edges required to be removed so that the order of each disconnected component is less than k.
Collaboration network of the authors
10 authors ·
21 co-authorship links
· 6 across different organisations
Hover or tap a name to highlight its co-authors. Double-click to open the author's page.
President University
Mississippi College
Maranatha Christian University
Different organisations
Same organisation
Affiliation unknown
Thicker line = more joint articles · bigger circle = more articles
Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.