Diagnosability of a multiprocessor system is an important study topic. S. L. Peng, C. K. Lin, J. J. M. Tan, and L. H. Hsu [Appl. Math. Comput., 2012, 218(21): 10406-10412] proposed a new measure for fault diagnosis...Diagnosability of a multiprocessor system is an important study topic. S. L. Peng, C. K. Lin, J. J. M. Tan, and L. H. Hsu [Appl. Math. Comput., 2012, 218(21): 10406-10412] proposed a new measure for fault diagnosis of the system, which is called the 9-good-neighbor conditional diagnosability that restrains every fault-free node containing at least 9 fault-free neighbors. As a famous topological structure of intereonnection networks, the n-dimensional star graph Sn has many good properties. In this paper, we establish the 9_good-neighbor conditional diagnosability of Sn under the PMC model and MM* model.展开更多
The growing size of the multiprocessor systems increases their vulnerability to component failures. It is crucial to local and to replace the fault processors to maintain system’s high reliability. The fault diagnosi...The growing size of the multiprocessor systems increases their vulnerability to component failures. It is crucial to local and to replace the fault processors to maintain system’s high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. This paper establishes the diagnosabilities of the incomplete star graph Sn (n≥4) with missing links under the PMC model and its variant, the BGM model, and shows that the diagnosabilities of incomplete star graph Sn under these two diagnostic models can be determined by the minimum degree of its topology structure. This method can also be applied to the other existing multiprocessor systems.展开更多
In this paper, a necessary and sufficient condition is given for a commutative Artinian local ring whose annihilating-ideal graph is a star graph. Also, a complete char- acterization is established for a finite local ...In this paper, a necessary and sufficient condition is given for a commutative Artinian local ring whose annihilating-ideal graph is a star graph. Also, a complete char- acterization is established for a finite local ring whose annihilating-ideal graph is a star graph.展开更多
A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa( G),is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a f...A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa( G),is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a forest whose components are stars of order at most k + 1. The k-star arboricity of a graph G,denoted by sak( G),is the minimum number of k-star forests needed to decompose G. In this paper,it is proved that if any two vertices of degree 3 are nonadjacent in a subcubic graph G then sa2( G) ≤2.For general subcubic graphs G, a polynomial-time algorithm is described to decompose G into three 2-star forests. For a tree T andΔ( a positive integer k, T)it is proved that≤ sakk( T) ≤Δ( T)- 1+ 1,where Δ( T) is the maximum degree of T.kMoreover,a linear-time algorithm is designed to determine whether sak( T) ≤m for any tree T and any positive integers m and k.展开更多
树是连通的无圈图,研究树的拉普拉斯矩阵具有重要的图论和实际意义.设G是一个有n个点和m个边的图,A(G)和D(G)分别是图G的邻接矩阵和对角度矩阵,那么G的拉普拉斯矩阵定义为L(G)=D(G)-A(G).LI矩阵定义为LI(G)=L(G)-(2m/n)I_(n),其中I_(n)...树是连通的无圈图,研究树的拉普拉斯矩阵具有重要的图论和实际意义.设G是一个有n个点和m个边的图,A(G)和D(G)分别是图G的邻接矩阵和对角度矩阵,那么G的拉普拉斯矩阵定义为L(G)=D(G)-A(G).LI矩阵定义为LI(G)=L(G)-(2m/n)I_(n),其中I_(n)是单位矩阵.图的LI矩阵的Ky Fan k-范数代表了拉普拉斯特征值和拉普拉斯特征值平均值之间距离的有序和.研究了双星图的LI矩阵的Ky Fan k-范数,证明了双星图的LI矩阵的Ky Fan k-范数满足文献[6]中提出的猜想.展开更多
In this paper, we will explain the relevance of the starant graphs, graphs created by us in the year of 2002. They were basically circulant graphs with a star graph that connects to all the vertices of the circulant g...In this paper, we will explain the relevance of the starant graphs, graphs created by us in the year of 2002. They were basically circulant graphs with a star graph that connects to all the vertices of the circulant graphs from inside of them, but they did not exist as a separate object of study in the year of 2002, as for all we knew. We now know that they can be used to model even social networking interactions, and they do that job better than any other graph we could be trying to use there. With the development of our mathematical tools, lots of conclusions will be made much more believable and therefore will become much more likely to get support from the relevant industries when attached to new queries.展开更多
Let f be a map from V(G) to . For each edge uv assign the label . f is called a mean cordial la- beling if and , , where and denote the number of vertices and edges respectively labelled with x ( ). A graph with a mea...Let f be a map from V(G) to . For each edge uv assign the label . f is called a mean cordial la- beling if and , , where and denote the number of vertices and edges respectively labelled with x ( ). A graph with a mean cordial labeling is called a mean cor- dial graph. We investigate mean cordial labeling behavior of Paths, Cycles, Stars, Complete graphs, Combs and some more standard graphs.展开更多
基金This work was supported by the National Natural Science Foundation of China (Grant No. 61370001).
文摘Diagnosability of a multiprocessor system is an important study topic. S. L. Peng, C. K. Lin, J. J. M. Tan, and L. H. Hsu [Appl. Math. Comput., 2012, 218(21): 10406-10412] proposed a new measure for fault diagnosis of the system, which is called the 9-good-neighbor conditional diagnosability that restrains every fault-free node containing at least 9 fault-free neighbors. As a famous topological structure of intereonnection networks, the n-dimensional star graph Sn has many good properties. In this paper, we establish the 9_good-neighbor conditional diagnosability of Sn under the PMC model and MM* model.
基金the Foundation of Fujian Provincial Department of Science & Technology (No. 2006F5035)the National Natural Science Foundation of China (No. 60502047)
文摘The growing size of the multiprocessor systems increases their vulnerability to component failures. It is crucial to local and to replace the fault processors to maintain system’s high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. This paper establishes the diagnosabilities of the incomplete star graph Sn (n≥4) with missing links under the PMC model and its variant, the BGM model, and shows that the diagnosabilities of incomplete star graph Sn under these two diagnostic models can be determined by the minimum degree of its topology structure. This method can also be applied to the other existing multiprocessor systems.
基金The first author is supported by Fundamental Research Funds for the Central Universi- ties (No. XDJK2013C060), Chongqing Research Program of Application Foundation and Advanced Technology (No. cstc2014jcyjA00028) and Scientific Research Foundation for Doctors of Southwest University (No. SWUl12054). The second author is supported by National Natural Science Foundation of China (No. 11271250).
文摘In this paper, a necessary and sufficient condition is given for a commutative Artinian local ring whose annihilating-ideal graph is a star graph. Also, a complete char- acterization is established for a finite local ring whose annihilating-ideal graph is a star graph.
基金National Natural Science Foundation of China(No.10971025)
文摘A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa( G),is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a forest whose components are stars of order at most k + 1. The k-star arboricity of a graph G,denoted by sak( G),is the minimum number of k-star forests needed to decompose G. In this paper,it is proved that if any two vertices of degree 3 are nonadjacent in a subcubic graph G then sa2( G) ≤2.For general subcubic graphs G, a polynomial-time algorithm is described to decompose G into three 2-star forests. For a tree T andΔ( a positive integer k, T)it is proved that≤ sakk( T) ≤Δ( T)- 1+ 1,where Δ( T) is the maximum degree of T.kMoreover,a linear-time algorithm is designed to determine whether sak( T) ≤m for any tree T and any positive integers m and k.
文摘树是连通的无圈图,研究树的拉普拉斯矩阵具有重要的图论和实际意义.设G是一个有n个点和m个边的图,A(G)和D(G)分别是图G的邻接矩阵和对角度矩阵,那么G的拉普拉斯矩阵定义为L(G)=D(G)-A(G).LI矩阵定义为LI(G)=L(G)-(2m/n)I_(n),其中I_(n)是单位矩阵.图的LI矩阵的Ky Fan k-范数代表了拉普拉斯特征值和拉普拉斯特征值平均值之间距离的有序和.研究了双星图的LI矩阵的Ky Fan k-范数,证明了双星图的LI矩阵的Ky Fan k-范数满足文献[6]中提出的猜想.
文摘In this paper, we will explain the relevance of the starant graphs, graphs created by us in the year of 2002. They were basically circulant graphs with a star graph that connects to all the vertices of the circulant graphs from inside of them, but they did not exist as a separate object of study in the year of 2002, as for all we knew. We now know that they can be used to model even social networking interactions, and they do that job better than any other graph we could be trying to use there. With the development of our mathematical tools, lots of conclusions will be made much more believable and therefore will become much more likely to get support from the relevant industries when attached to new queries.
文摘Let f be a map from V(G) to . For each edge uv assign the label . f is called a mean cordial la- beling if and , , where and denote the number of vertices and edges respectively labelled with x ( ). A graph with a mean cordial labeling is called a mean cor- dial graph. We investigate mean cordial labeling behavior of Paths, Cycles, Stars, Complete graphs, Combs and some more standard graphs.