4 papers · 1 filter
Bipartite holes, degree sums and Hamilton cycles
Mark Ellingham, Yixuan Huang, Bing Wei
The {\em bipartite-hole-number} of a graph , denoted as , is the minimum number such that there exist integers and with such that for a…
Independent Bondage Number in Graphs under Girth Constraints
E. G. K. M. Gamlath, Andrew Pham, Bing Wei
Given a finite, simple graph , the independent bondage number of is the minimum size of an edge set such that its deletion results in a graph with strictly larger independen…
Graph Configurations and Independent Bondage Numbers of Planar Graphs
E. G. K. M. Gamlath, Bing Wei, Talmage James Reid
The independent domination number of a finite graph G is the minimum cardinality of an independent dominating set of vertices. The independent bondage number of G is the minimum ca…
On Total Bondage Number of Graphs
E. G. K. M. Gamlath, Bing Wei
In this paper, we explore the concept of total bondage in finite graphs without isolated vertices. A vertex set is considered a total dominating set if every vertex in the…