We initiate the study of hedge connectivity of undirected graphs, motivated by dependent edge failures in real-world networks. In this model, edges are partitioned into groups called hedges that fail together. The hedge connectivity of a graph is the minimum number of hedges whose removal disconnects the graph. We give a polynomial-time approximation scheme and a quasi-polynomial exact algorith...

With the increase in deployment of multi-hop wireless networks and the desire for seamless internet access through ubiquitous connectivity, the inter-working of heterogeneous multi-hop wireless networks will become prominent in the near future. To complement the quest for ubiquitous service access, multi-mode mobile terminals are now in existence. Inter-working heterogeneous multi-hop wireless ...

The [Formula: see text]-extra edge-connectivity is an important measure for the reliability of interconnection networks. Recently, Yang et al. [Appl. Math. Comput. 320 (2018) 464–473] determined balanced hypercubes text] and conjectured that text]. In this paper, we confirm their conjecture text], disprove where

Title of Document: OBSERVING AND IMPROVING THE RELIABILITY OF INTERNET LAST-MILE LINKS Aaron David Schulman, Doctor of Philosophy, 2013 Directed By: Professor Neil Spring Department of Computer Science People rely on having persistent Internet connectivity from their homes and mobile devices. However, unlike links in the core of the Internet, the links that connect people’s homes and mobile dev...

Abstract A reliable water distribution network (WDN) can provide an adequate supply service to customers under both normal and abnormal working conditions. The WDN reliability analysis, therefore, is a keystone improve the efficiency. Strategies for analysis are usually proved on small WDNs, which do not compare with large real complex systems in terms of number tanks, pressure reduction valves...

the first extended zeroth-order connectivity index of a graph   g is defined as 0 1/2 1 ( ) ( ) ,   v   v v g      g d      where   v   (g) is the vertex set of g, and v d is the sum of degrees of neighbors of vertex v in g. we give a sharp lower bound for the first extended zeroth-order connectivity index of trees with given numbers of vertices and pendant vertices,...