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 23 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)
- On conflict-free connection of graphs (Q1727736) (← links)
- Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- Nordhaus-Gaddum type inequality for the fractional matching number of a graph (Q2078840) (← links)
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (Q2082190) (← links)
- Path 3-(edge-)connectivity of lexicographic product graphs (Q2185739) (← links)
- The \(\kappa_k\)-connectivity of line graphs (Q2197398) (← links)
- Monochromatic disconnection of graphs (Q2208356) (← links)
- The minimum size of a graph with given tree connectivity (Q2227103) (← links)
- \(k\)-tree connectivity of line graphs (Q2231726) (← links)
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs (Q2409788) (← links)
- Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs (Q5039404) (← links)
- Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings (Q5103954) (← links)
- The number of independent sets in a connected graph and its complement (Q5198015) (← links)
- Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks (Q5374226) (← links)