Graphs with large generalized (edge-)connectivity

From MaRDI portal




Abstract: The generalized k-connectivity kappak(G) of a graph G, introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, we proposed the concept of generalized k-edge-connectivity lambdak(G). In this paper, graphs of order n such that kappak(G)=nfrack21 and lambdak(G)=nfrack21 for even k are characterized.



Cites work







This page was built for publication: Graphs with large generalized (edge-)connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339485)