Graph Configurations and Independent Bondage Numbers of Planar Graphs
Combinatorics
2024-02-06 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2402.02083,
title = {Graph Configurations and Independent Bondage Numbers of Planar Graphs},
author = {E. G. K. M. Gamlath and Bing Wei and Talmage James Reid},
journal= {arXiv preprint arXiv:2402.02083},
year = {2024}
}