Journal of Graph Theory . 1989L. Volkmann.Edge-connectivity in p-partite graphs.J. Graph Theory. 1989L. Volkmann, Edge connectivity in p-partite graphs, J. Graph Theory 13(1)(1989) 1-6.Volkmann, L.: Edge connectivity in \(p\) -partite graphs. J. Graph Theory 13 (1), 1–6 (...
For basic terminology in graph theory, we refer to [2]. In 1950s, Claude Shannon invented the following game, as a simple model for breakdown repair of the connectivity of a network [7, pp. 86–87]: Shannon switching game. There are two players; Short and Cut. For a given connected...
作者: A NOTE ON EDGE-CONNECTIVITY OF THE CARTESIAN PRODUCT OF GRAPHS 摘要: The main aim of this paper is to establish conditions that are necessary and sufficient for the edge-connectivity of the Cartesian product of two graphs to equal the sum of the edge-connectivities of the factors. Th...
In this paper we give simple degree sequence conditions for the equality of edge-connectivity and minimum degree of a (di-)graph. One of the conditions imp... P Dankelmann,L Volkmann - 《Journal of Graph Theory》 被引量: 135发表: 1997年 On conditional edge-connectivity of graphs Letk ...
In this paper, we will study the main properties of v(G), e(G) and establish some upper and lower bounds for them. The numbers v and e for titania nanotubes are also computed. 展开 关键词: MOLECULAR connectivity index GRAPH connectivity NANOTUBES ...
Super restricted connectivity and super restricted edge connectivity are more refined network reliability indices than connectivity and edge connectivity. In this paper, we first introduce the concepts of super restricted connectivity and super restricted edge connectivity and then give a property of graphs...
The main aim of this paper is to establish conditions that are necessary and sufficient for the edge-connectivity of the Cartesian product of two graphs to equal the sum of the edge-connectivities of the factors. The paper also clarifies an issue that has arisen in the literature on Cartesian...
We describe an algorithm that determines the edge connectivity of an n-vertex m-edge graph G in O(nm) time. A refinement shows that the question as to whether a graph is k-edge connected can be determined in O(kn2). For dense graphs characterized by m = Ω(n2), the latter result ...
Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line Two vertices of an undirected graph are called k -edge-connected if there exist k edge-disjoint paths between them (equivalently, they cannot be disconne... Y Dinitz,J Westbrook - 《Algorithmica》 被引量: 35发表: 1998年 Im...
The super edge-connectivity λ′ of a connected graph G is the minimum cardinality of an edge-cut F in G such that every component of G–F contains at least two vertices. Let two connected graphs Gmand Gphave m and p vertices, minimum degree δ(Gm) and δ(Gp), edge-connectivity λ...