Title :
Neighbor-scattering number in regular graphs
Author :
Li, Fengwei ; Ye, Qingfang ; Wang, Shuhua
Abstract :
Network reliability is an important issue in the area of distributed computing. Most of the early work in this area takes a probabilistic approach to the problem. However, sometimes it is important to incorporate subjective reliability estimate s into the measure. To serve this goal, we propose the use of neighbor-scattering number, a measure of graph vulnerability. In this paper, we give a complete characterization of all minimal (1 - k)-neighbor-scattered graph which are k-regular and contain a k-clique.
Keywords :
graph theory; network theory (graphs); distributed computing; graph vulnerability measurement; k-clique; k-regular; neighbor-scattering number; network reliability; probabilistic approach; regular graphs; subjective reliability estimation; Communication networks; Image edge detection; Joints; Lead; Reliability; Scattering; Solids; Neighbor-connectivity; Neighbor-scattering number; m-neighbor-scattered graph;
Conference_Titel :
Multimedia Technology (ICMT), 2011 International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-61284-771-9
DOI :
10.1109/ICMT.2011.6002618