LAUSR

On Cyclic-Vertex Connectivity of n , k -Star Graphs

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

Gromov–Hausdorff–Prokhorov convergence of vertex cut-trees of $n$-leaf Galton–Watson trees

Sign Up to like & get
recommendations!
1 Published in 2019 at "Bernoulli"

DOI: 10.3150/18-bej1055

Abstract: In this paper we study the vertex cut-trees of Galton-Watson trees conditioned to have $n$ leaves. This notion is a slight variation of Dieuleveut's vertex cut-tree of Galton-Watson trees conditioned to have $n$ vertices. Our… read more here.

Keywords: gromov hausdorff; watson trees; galton watson; prokhorov ... See more keywords