AbstractA graph with n vertices and minimum degree k⩾2 can contain no more than (2k−2)n(k2−2) cut vertices. This bound is asymptotically tight
AbstractWe derive an asymptotic formula for the number of graphs with n vertices all of degree at le...
Presented in-person and online via Bluejeans meetings on October 18, 2021 at 11:00 a.m.Anupam Gupta ...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
We relate the number of minimum cuts in a weighted undirected graph with various structural paramete...
We relate the number of minimum cuts in a weighted undi- rected graph with various structural param...
We prove that in an undirected graph there are at most $O(n^2)$ cuts of size strictly less than $\fr...
A block of a graph is a nonseparable maximal subgraph of the graph. We denote by bG the number of bl...
Consider the class of graphs on n vertices which have maximum degree at most 1/2 n - 1 + τ, where τ ...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
We investigate the smallest number λe(G) of edges that can be removed from a non-empty graph G so th...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
We investigate the smallest number λ(G) of vertices that need to be removed from a non-empty graph G...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
AbstractWe consider the graphs Han defined as the Cartesian products of n complete graphs with a ver...
AbstractWe derive an asymptotic formula for the number of graphs with n vertices all of degree at le...
Presented in-person and online via Bluejeans meetings on October 18, 2021 at 11:00 a.m.Anupam Gupta ...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
We relate the number of minimum cuts in a weighted undirected graph with various structural paramete...
We relate the number of minimum cuts in a weighted undi- rected graph with various structural param...
We prove that in an undirected graph there are at most $O(n^2)$ cuts of size strictly less than $\fr...
A block of a graph is a nonseparable maximal subgraph of the graph. We denote by bG the number of bl...
Consider the class of graphs on n vertices which have maximum degree at most 1/2 n - 1 + τ, where τ ...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
We investigate the smallest number λe(G) of edges that can be removed from a non-empty graph G so th...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
We investigate the smallest number λ(G) of vertices that need to be removed from a non-empty graph G...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
AbstractWe consider the graphs Han defined as the Cartesian products of n complete graphs with a ver...
AbstractWe derive an asymptotic formula for the number of graphs with n vertices all of degree at le...
Presented in-person and online via Bluejeans meetings on October 18, 2021 at 11:00 a.m.Anupam Gupta ...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
DOI
Add to ORKG