Your English writing platform
Discover LudwigSuggestions(5)
Exact(4)
Let G= V,E) be a regular graph of valency d.
Let G be a regular graph of degree r with n vertices.
Let G be a regular graph of degree r ((r>1)) having n vertices.
From Lemma 2.6, it follows directly that if G be a regular graph of degree r with n vertices, then frac{nr}{sqrt{r+1}}leqmathit{LEL}(G)leqsqrt{ n-2+sqrt { n-2) (nr-r-1)}, (5) with both equalities if and only if (Gcong K_{n}).
Similar(56)
An n-dimensional Bijective Connection graph (in brief BC graph) is a regular graph with 2n nodes and n2n−1 edges.
The equality holds if and only if X is a regular graph.
Moreover, the equality holds in (14) if and only if G is a regular graph.
And the equality holds if and only if G is a regular graph or a bipartite semi-regular graph.
And the equality holds in (15) for regular graphs if and only if G is a regular graph.
Moreover, the equality holds in (3) if and only if both G 1 and G 2 are regular graphs, that is, G 1 ∨ G 2 is a regular graph and the equality holds in (4) if and only if both G 1 and G 2 are regular graphs, that is, G 1 ∨ G 2 is a regular graph.
If ({mathbb {G}}(A)) is a regular graph of finite degree, then ({mathbb {G}}(A)) is a complete graph.
More suggestions(1)
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