Sign Up to like & get
recommendations!
0
Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-019-00400-6
Abstract: For a connected graph G, a set S of vertices is a cyclic vertex cutset if $$G - S$$G-S is not connected and at least two components of $$G-S$$G-S contain a cycle respectively. The cyclic…
read more here.
Keywords:
algorithm determining;
polynomial algorithm;
vertex connectivity;
cyclic vertex ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2019 at "Journal of Algebra and Its Applications"
DOI: 10.1142/s0219498820920012
Abstract: We retract [1, Lemma 3.4] as the statement is incorrect. In consequence, we correct the statements of Theorems 1.2 and 4.5 and their proofs.
read more here.
Keywords:
graph finite;
erratum vertex;
vertex connectivity;
connectivity power ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2021 at "Mathematical Problems in Engineering"
DOI: 10.1155/2021/5570761
Abstract: Let G � (V, E) be a simple connected graph, where V and E are the vertex set and the edge set, respectively. G[H] is an induced subgraph by H⊆V, whose vertex set is H…
read more here.
Keywords:
vertex connectivity;
vertex cut;
cyclic vertex;
vertex ... See more keywords