The edge-subconnectivity of a graph is defined to be the largest of all the subgraph edge connectivities. A graph is said to be type (n, l) if no subgraph on l or more points is n-edge connected. A canonical class of (n, l) graphs called star-like-(n, l) graphs are introduced. It is then shown that no (n, l) graph has more edges than these canonical graphs.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics