Skip to main content
image of ropes wound together

K - S U P E R  B O N D A G E  N U M B E R  O N  G R A P H S

September 23, 2019

Epsilon Talk by Alvero Belmonte

The k-Super Bondage (k-SB) of a graph is the smallest
number of edges that, when removed, increases the
dominating number by at least k. We will show the 2-SB
for some graph classes and also show the minimal value
of 2-SB over the class of graphs, G(n,m), which
consists of graphs with n vertices and m edges.

 

DATE: Monday, September 23rd at 2pm

WHERE: Sally 335