Counting Edge Cuts of Undirected Binary De Bruijn Graphs
Jianping Ou · Neimenggu Shi-da xuebao. Zhexue shehui kexue hanwen ban · 2004
Employing the maximal restricted edge connectivity of undirected binary de Bruijn graph UB(2,n) ,we enumerate its edge cuts and determine the number of edge cuts that have size at most three. An upper bound on the number of edge cuts of size four are also presented,which we believe is sharp.