笛卡尔积图的f-点稳定数
The f-Vertex Stability Number of Cartesian Product Graphs
DOI: 10.12677/aam.2024.1312517, PDF,    国家自然科学基金支持
作者: 肖李宵, 买吐肉孜·买司地克*:新疆师范大学数学科学学院,新疆 乌鲁木齐
关键词: 笛卡尔积图不变量点稳定数Cartesian Product Graph Invariant Vertex Stability Number
摘要: 图的不变量点稳定数是最近的热点问题之一,它被应用于设计算法解决图论的某些特定问题。设 f 是图不变量,图 G f -点稳定数 v s f ( G ) 定义为使得 f( G V )f( G ) 成立的最小点子集 V 的基数。在本文中,通过不变量 f 的性质,讨论笛卡尔积图的 f -点稳定数的界。
Abstract: The invariant vertex stability number of graph is one of the recent hot topics, which is applied to design algorithms to solve certain problems in graph theory. Let f be an invariant of graphs, and the f -vertex stability number v s f ( G ) of a graph G is defined as the cardinality of the minimum vertex subset V such that f( G V )f( G ) . In this paper, we discuss the bounds of the f -vertex stability number for Cartesian product graphs through the properties of the invariant f .
文章引用:肖李宵, 买吐肉孜·买司地克. 笛卡尔积图的f-点稳定数[J]. 应用数学进展, 2024, 13(12): 5350-5357. https://doi.org/10.12677/aam.2024.1312517

参考文献

[1] Staton, W. (1980) Edge Deletions and the Chromatic Number. Ars Combinatoria, 10, 103-106.
[2] Harary, F. (1982) Changing and Unchanging Invariants for Graphs. Bulletin of the Malaysian Mathematical Sciences Society, 5, 73-78.
[3] Haynes, T.W., Lawson, L.M., Brigham, R.C. and Dutton, R.D. (1990) Changing and Unchanging of the Graphical Invariants: Minimum and Maximum Degree, Maximum Clique Size, Node Independence Number and Edge Independence Number. Congressus Numerantium, 72, 239-252.
[4] Bauer, D., Harary, F., Nieminen, J. and Suffel, C.L. (1983) Domination Alteration Sets in Graphs. Discrete Mathematics, 47, 153-161. [Google Scholar] [CrossRef
[5] Kemnitz, A. and Marangio, M. (2019) On the Rho-Edge Stability Number of Graphs. Discussiones Mathematicae Graph Theory, 42, 249-262. [Google Scholar] [CrossRef
[6] Kemnitz, A., Marangio, M. and Movarraei, N. (2018) On the Chromatic Edge Stability Number of Graphs. Graphs and Combinatorics, 34, 1539-1551. [Google Scholar] [CrossRef
[7] Akbari, S., Beikmohammadi, A., Klavžar, S. and Movarraei, N. (2022) On the Chromatic Vertex Stability Number of Graphs. European Journal of Combinatorics, 102, Article ID: 103504. [Google Scholar] [CrossRef
[8] Akbari, S., Klavžar, S., Movarraei, N. and Nahvi, M. (2020) Nordhaus-Gaddum and Other Bounds for the Chromatic Edge-Stability Number. European Journal of Combinatorics, 84, Article ID: 103042. [Google Scholar] [CrossRef
[9] Huang, S., Klavžar, S., Lei, H., Lian, X. and Shi, Y. (2022) Some Extremal Results on the Chromatic Stability Index. Bulletin of the Australian Mathematical Society, 106, 185-194. [Google Scholar] [CrossRef
[10] Kemnitz, A. and Marangio, M. (2024) On the Vertex Stability Numbers of Graphs. Discrete Applied Mathematics, 344, 1-9. [Google Scholar] [CrossRef
[11] Klavžar, S. (2000) Product Graphs: Structure and Recognition. Wiley.