平面图的图配置与独立束缚数
Graph Configurations and Independent Bondage Numbers of Planar Graphs
AI总结：
本研究通过识别平面图中的特定配置，增强了最小度至少为三的平面图独立束缚数的现有上界。
摘要：
有限图G的独立支配数是独立支配顶点集的最小基数。G的独立束缚数是使删除后得到的图的独立支配数大于G的独立支配数的边集的最小基数。在本研究中，我们通过识别最小度至少为三的平面图中的特定配置，增强了此类平面图独立束缚数的现有上界。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
