2024/02/03 by E. G. K. M. Gamlath, Gamlath, E. G. K. M., Bing Wei +3
Computer Science · Engineering · #05C35 #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #G.2.2 #Manufacturing Process and Optimization
paper · pdf · doi:10.48550/arxiv.2402.02083
openalex publication_date 2024/02/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 cardinality of a set of edges whose deletion results in a graph with a larger independent domination number than that of G. In this research, we enhance the existing upper bound on the independent bondage number of a planar graph with a minimum degree of at least three by identifying specific configurations within such planar graphs.