Pages that link to "Item:Q2341720"
From MaRDI portal
The following pages link to Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (Q2341720):
Displayed 11 items.
- Sharp upper bounds for generalized edge-connectivity of product graphs (Q339466) (← links)
- Graphs with large generalized (edge-)connectivity (Q339485) (← links)
- Tree connectivities of Cayley graphs on abelian groups with small degrees (Q503543) (← links)
- The generalized 4-connectivity of hypercubes (Q507578) (← links)
- A solution to a conjecture on the generalized connectivity of graphs (Q512887) (← links)
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- Nordhaus-Gaddum type result for the matching number of a graph (Q1680497) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs (Q2409788) (← links)
- Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks (Q5374226) (← links)