Pages that link to "Item:Q2364084"

The following pages link to On the maximum and minimum sizes of a graph with given \(k\)-connectivity (Q2364084):

Displaying 9 items.

• Bounds on the size of graphs of given order and \(l\)-connectivity (Q1292831) (← links)
• On two generalized connectivities of graphs (Q1692646) (← links)
• Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (Q2082190) (← links)
• Separation of Cartesian products of graphs into several connected components by the removal of vertices (Q2151221) (← links)
• The minimum size of a graph with given tree connectivity (Q2227103) (← links)
• A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs (Q2409788) (← links)
• Minimally \((n,\lambda)\)-connected graphs of low order and maximal size (Q2573845) (← links)
• Turán's theorem and <i>k</i>‐connected graphs (Q5387053) (← links)
• On maximum Zagreb indices of bipartite graphs with a given connectivity (Q6650429) (← links)