In the work of Peng et al.(Appl Math Comput 218(21):10406–10412,2012),a new measure was proposed for fault diagnosis of systems:namely g-goodneighbor conditional diagnosability,which requires that any fault-free vert...In the work of Peng et al.(Appl Math Comput 218(21):10406–10412,2012),a new measure was proposed for fault diagnosis of systems:namely g-goodneighbor conditional diagnosability,which requires that any fault-free vertex has at least g fault-free neighbors in the system.In this paper,we establish the g-goodneighbor conditional diagnosability of locally twisted cubes under the PMC model and the MM∗model.展开更多
The k-component edgeconnectivity cλk(G)of anon-completegraph G is themini mum number of edges whose deletion results in a graph with at least k components In this paper,we extend some results by Guo et al.(Appl Math ...The k-component edgeconnectivity cλk(G)of anon-completegraph G is themini mum number of edges whose deletion results in a graph with at least k components In this paper,we extend some results by Guo et al.(Appl Math Comput 334:401-406,2018)by determining the component edge connectivity of the locally twisted cubes LTQn,i.e.,cλk+1(LTQn)=kn-exk/2for 1≤2[n/2],n≥7,where exk=∑si=0ti2ti+∑si=02·i·2ti,and k is a positive integer with decomposition k=∑si=02ti such that to="log2k"and ti="log2(k-∑i-1 r=02tr)"for i≥1.As a by-product,we characterize the corresponding optimal solutions.展开更多
基金This research was supported by the National Natural Science Foundation of China(Nos.11571044 and 61373021)the Fundamental Research Funds for the Central University of China.
文摘In the work of Peng et al.(Appl Math Comput 218(21):10406–10412,2012),a new measure was proposed for fault diagnosis of systems:namely g-goodneighbor conditional diagnosability,which requires that any fault-free vertex has at least g fault-free neighbors in the system.In this paper,we establish the g-goodneighbor conditional diagnosability of locally twisted cubes under the PMC model and the MM∗model.
基金the National Natural Science Foundation of China(No.11531011).
文摘The k-component edgeconnectivity cλk(G)of anon-completegraph G is themini mum number of edges whose deletion results in a graph with at least k components In this paper,we extend some results by Guo et al.(Appl Math Comput 334:401-406,2018)by determining the component edge connectivity of the locally twisted cubes LTQn,i.e.,cλk+1(LTQn)=kn-exk/2for 1≤2[n/2],n≥7,where exk=∑si=0ti2ti+∑si=02·i·2ti,and k is a positive integer with decomposition k=∑si=02ti such that to="log2k"and ti="log2(k-∑i-1 r=02tr)"for i≥1.As a by-product,we characterize the corresponding optimal solutions.
