给定点的局部平均控制集的研究
The Local Average Order of Dominating Sets Containing a Fixed Vertex
DOI: 10.12677/aam.2026.153090, PDF,   
作者: 陈婷韵, 何伟骅*:广东工业大学数学与统计学院,广东 广州
关键词: 控制集平均阶数控制多项式Dominating Set Average Order Domination Polynomial
摘要: G 的平均控制集 avd( G ) 是其所有控制集的顶点数的平均值。类似地,局部平均控制集 av d v ( G ) 是所有含给定点 v 的控制集的顶点数的平均值。 G 的控制多项式 D( G,x ) 是其控制集的生成函数,由于平均控制集是控制多项式的对数导数在1处的取值,在本文中,我们利用平均控制集和控制多项式之间的关系给出了 n( n3 ) 阶连通图中度为 n2 的给定点的局部平均控制集的公式。
Abstract: The global average order of dominating sets of a graph avd( G ) is the average number of vertices of its dominating sets. Analogously, the local average order of dominating sets av d v ( G ) is the average number of vertices of its dominating sets containing a fixed vertex v . The domination polynomial D( G,x ) of a graph G is the generating function of its dominating sets. The global average order of dominating sets is the value of the logarithmic derivative of the domination polynomial at x=1 . In this paper, we derive a formula for the local average order of dominating sets in the case where the degree of the fixed vertex is n2 .
文章引用:陈婷韵, 何伟骅. 给定点的局部平均控制集的研究[J]. 应用数学进展, 2026, 15(3): 87-94. https://doi.org/10.12677/aam.2026.153090

参考文献

[1] Doyle, J.K. and Graver, J.E. (1977) Mean Distance in a Graph. Discrete Mathematics, 17, 147-154. [Google Scholar] [CrossRef
[2] Jamison, R.E. (1983) On the Average Number of Nodes in a Subtree of a Tree. Journal of Combinatorial Theory, Series B, 35, 207-223. [Google Scholar] [CrossRef
[3] Cambie, S., Wagner, S. and Wang, H. (2021) On the Maximum Mean Subtree Order of Trees. European Journal of Combinatorics, 97, Article 103388. [Google Scholar] [CrossRef
[4] Li, Z., Ma, T., Dong, F. and Jin, X. (2024) On the Maximum Local Mean Order of Sub-k-Trees of a k-Tree. Journal of Graph Theory, 107, 393-409.
[5] Mol, L. and Oellermann, O.R. (2019) Maximizing the Mean Subtree Order. Journal of Graph Theory, 91, 326-352. [Google Scholar] [CrossRef
[6] Cambie, S., Chen, G., Hao, Y. and Tokar, N. (2024) Decreasing the Mean Subtree Order by Adding k Edges. Journal of Graph Theory, 105, 357-366. [Google Scholar] [CrossRef
[7] Cameron, B. and Mol, L. (2021) On the Mean Subtree Order of Graphs under Edge Addition. Journal of Graph Theory, 96, 403-413. [Google Scholar] [CrossRef
[8] Jamison, R.E. (1984) Monotonicity of the Mean Order of Subtrees. Journal of Combinatorial Theory, Series B, 37, 70-78. [Google Scholar] [CrossRef
[9] Luo, Z., Xu, K., Wagner, S. and Wang, H. (2023) On the Mean Subtree Order of Trees under Edge Contraction. Journal of Graph Theory, 102, 535-551. [Google Scholar] [CrossRef
[10] Wang, R. (2024) On the Difference of Mean Subtree Orders under Edge Contraction. Journal of Combinatorial Theory, Series B, 169, 45-62. [Google Scholar] [CrossRef
[11] Andriantiana, E.O.D., Razanajatovo Misanantenaina, V. and Wagner, S. (2020) The Average Size of Independent Sets of Graphs. European Journal of Mathematics, 6, 561-576. [Google Scholar] [CrossRef
[12] Davies, E., Jenssen, M., Perkins, W. and Roberts, B. (2017) On the Average Size of Independent Sets in Triangle-Free Graphs. Proceedings of the American Mathematical Society, 146, 111-124. [Google Scholar] [CrossRef
[13] Andriantiana, E.O.D., Razanajatovo Misanantenaina, V. and Wagner, S. (2020) The Average Size of Matchings in Graphs. Graphs and Combinatorics, 36, 539-560. [Google Scholar] [CrossRef
[14] Beineke, L.W., Oellermann, O.R. and Pippert, R.E. (2002) The Average Connectivity of a Graph. Discrete Mathematics, 252, 31-45. [Google Scholar] [CrossRef
[15] Alochukwu, A. and Dankelmann, P. (2023) On Wiener Index and Average Eccentricity of Graphs of Girth at Least 6 and (C4,C5)-Free Graphs. Discrete Applied Mathematics, 330, 98-111.
[16] Dankelmann, P. and Osaye, F.J. (2019) Average Eccentricity, k-Packing and k-Domination in Graphs. Discrete Mathematics, 342, 1261-1274.
[17] Horoldagva, B., Buyantogtokh, L., Dorjsembe, S., Azjargal, E. and Adiyanyam, D. (2021) On Graphs with Maximum Average Eccentricity. Discrete Applied Mathematics, 301, 109-117. [Google Scholar] [CrossRef
[18] Beaton, I. and Brown, J.I. (2021) The Average Order of Dominating Sets of a Graph. Discrete Mathematics, 344, Article 112595. [Google Scholar] [CrossRef
[19] Erey, A. (2023) On the Average Order of a Dominating Set of a Forest. Discrete Mathematics, 346, Article 113127. [Google Scholar] [CrossRef
[20] Beaton, I. and Cameron, B. (2024) A Tight Upper Bound on the Average Order of Dominating Sets of a Graph. Journal of Graph Theory, 107, 463-477. [Google Scholar] [CrossRef
[21] Kotek, T., Preen, J., Simon, F., Tittmann, P. and Trinks, M. (2012) Recurrence Relations and Splitting Formulas for the Domination Polynomial. The Electronic Journal of Combinatorics, 19, 47. [Google Scholar] [CrossRef