Exact(1)
Let be a connected -graph, and let and be as defined in (1.5) and (1.6), respectively.
Similar(59)
Let Gi be a connected graph with order νi and edge-connectivity λi for i= 1,2.
Let G be a connected graph.
Let G = (V, B) be a connected graph in ℝ2.
Let G be a connected graph of order n.
Let G be a connected graph on (n ge3) vertices.
Let G be a connected graph with d.
Let G be a connected graph without pendant vertices.
Let G be a connected graph with δ(G ≥3.
Let G be a connected graph of order n≥2.
Let G be a connected graph with diameter d.
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.

Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com