Residual reliability of P-threshold graphs

Three multiply connected Kn-residual graphs

“…According to the definition of the residual graph construction, the relevant residual graph can be constructed, and the original graph of the isomorphism can be found at the same time. The construction of the residual graph can explain the stability of the graph, for example, K 3 is a stable graph, which can be obtained by removing m occurrences from graph m − K 3 , therefore, residual graphs are usually applied in various fields such as image processing, computer network design, traffic network design, and cryptography [2][3][4][5][6].…”

“…G = G 3 [K4 ] is not isomorphic with K 11 × K 4 . Therefore, there are two connected 3 − K 8 -residual graphs of order 4n + 12 = 44.…”

New Sampling Plans for Estimating Residual Connectedness Reliability

“…However there is a relatively small number of works dedicated to the RCR problem. These works mostly consider specific graph topologies for which rigorous results can be obtained [13], [14], [15]. There has been very limited work done on the RCR problem for general graphs [16], [17].…”

On Connected m-HPK(n1,n2,n3,n4)Duan1, Li2 2013Journal of Discrete Mathematics0000View full textAdd to dashboardCite

“…We know that these supporting results are summarized in residual graph [7][8][9][10][11][12][13][14][15][16]. In this paper, we will study the important properties of hyperplane complete graph in relain to the minimum order of hyperplane complete graph and the minimum graph of hyperplane complete graph.…”