本文選題：Corona積 + 分辨集��； 參考：《應(yīng)用數(shù)學(xué)學(xué)報(bào)》2017年06期

【摘要】：圖的分辨集和度量維問(wèn)題是與網(wǎng)絡(luò)(頂點(diǎn))信息識(shí)別有關(guān)的一類(lèi)涉及包括機(jī)器人導(dǎo)航和網(wǎng)絡(luò)入侵者定位問(wèn)題在內(nèi)的多個(gè)實(shí)際研究鄰域的重要組合優(yōu)化問(wèn)題.一些大型網(wǎng)絡(luò)可以看作是通過(guò)圖的乘積運(yùn)算而得到.本文定義了廣義Corona積圖.研究并刻畫(huà)了積圖分辨集和基的一般構(gòu)成特性,得出了積圖度量維的界.基于子圖頂點(diǎn)距離劃分,給出了積圖度量維的一般計(jì)算公式;建立了尋找積圖基的算法和計(jì)算積圖度量維的0-1整數(shù)規(guī)劃模型.作為應(yīng)用,計(jì)算了一些特殊廣義Corona積圖的度量維.
[Abstract]:The problem of discernibility set and measurement dimension of graph is a kind of important combinatorial optimization problem related to network (vertex) information recognition which involves many practical neighborhood problems including robot navigation and network intruder location. Some large networks can be regarded as the product of graphs. In this paper, the generalized Corona product graph is defined. This paper studies and characterizes the general construction properties of the discernibility set and the basis of the product graph, and obtains the bounds of the metric dimension of the product graph. Based on the subgraph vertex distance partition, the general calculation formula of product graph metric dimension is given, and the algorithm for finding the basis of product graph and the 0-1 integer programming model for calculating product graph metric dimension are established. As an application, the metric dimensions of some special generalized Corona product graphs are calculated.
【作者單位】： 山西財(cái)經(jīng)大學(xué)應(yīng)用數(shù)學(xué)學(xué)院;山西財(cái)經(jīng)大學(xué)統(tǒng)計(jì)學(xué)院;
【基金】：國(guó)家自然科學(xué)基金(11626149)資助項(xiàng)目
【分類(lèi)號(hào)】：O157.5

【相似文獻(xiàn)】

相關(guān)期刊論文 前4條

1 ;The Minimum Fill-in for the Corona of Two Graphs[J];數(shù)學(xué)季刊;1996年01期

2 王鍵;一類(lèi)無(wú)窮連區(qū)域上的Corona定理[J];湘潭大學(xué)自然科學(xué)學(xué)報(bào);1986年03期

3 王鍵;一類(lèi)無(wú)窮連通區(qū)域上的無(wú)窮個(gè)數(shù)據(jù)的Corona定理[J];數(shù)學(xué)學(xué)報(bào);1988年02期

4 劉洋;韓靜;;多圓柱上的H~2 Corona問(wèn)題[J];同濟(jì)大學(xué)學(xué)報(bào)(自然科學(xué)版);2008年02期

，

本文編號(hào)：2016296