Results 11 to 20 of about 50 (50)
Connectivity Augmentation of Graphs
Electronic Notes in Discrete Mathematics, 2000 Abstract We consider the general problem of determining a smallest set of edges which must be added to a given graph (hyper graph, digraph)in order to make it k-edge-connected (k-vertex-connected). We give a short summary of those cases of the augmentation problems which have been solved by polynomial algorithms and min-max formulae. We then describe
Bill Jackson, Tibor Jordán
openaire +1 more source
Linear connections on graphs [PDF]
Journal of Mathematical Physics, 1997 In recent years, discrete spaces such as graphs have attracted much attention as models for physical spacetime or as models for testing the spirit of noncommutative geometry. In this work, we construct the differential algebras for graphs by extending the work of Dimakis et al. and discuss linear connections and curvatures on graphs.
Cho, Sunggoo, Park, Kwang Sung
openaire +3 more sources
Connectivity of path graphs [PDF]
Discussiones Mathematicae Graph Theory, 2000 The authors continue the study of path graphs. They give a necessary and sufficient condition for a connected graph (with some restrictions) to have a connected \(P_k\)-path graph, \(k\geq 2\). Moreover, they give an analogous condition for the connectivity of the \(P_3\)-path graph of a connected graph.
Martin Knor, Ludovít Niepel
openaire +1 more source
Random Structures & AlgorithmsAbstractThe symmetric difference of two graphs on the same set of vertices is the graph on whose set of edges are all edges that belong to exactly one of the two graphs . For a fixed graph call a collection of spanning subgraphs of a connectivity code for if the symmetric difference of any two distinct subgraphs in is a connected spanning ...
openaire +2 more sources
On the connectivity of cayley graphs
Journal of Combinatorial Theory, Series B, 1979 AbstractIt has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is greatest possible. The main Theorem of this paper weakens the condition of edge transitivity and is used to show that the connectivity of the graph of the assignment polytope is equal to its degree, thereby proving a conjecture of Balinski and Russakoff.
openaire +2 more sources
On the spanning connectivity of graphs
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng-Kuan Lin +2 more
openaire +1 more source
The connected cutset connectivity of a graph
Discrete Mathematics, 1988 The connected (edge-)cutset connectivity \(c\kappa\) (G) \((c\kappa_ 1(G))\) of a graph G is the minimum cardinality of a vertex (edge) cutset S of G such that the subgraph induced by S is connected. Let \(\kappa\) (G) be the vertex-connectivity of G, \(\kappa_ 1(G)\) the edge-connectivity and \(\delta\) (G) the minimal degree.
openaire +2 more sources
Connected graph searching in chordal graphs
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The complexity of graph connectivity [PDF]
, 1992 In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging open problems.
openaire +1 more source
Discrete Mathematics, 2007 A permutation graph is a simple graph associated with a permutation. Let \(c_n\) be the number of connected permutation graphs on \(n\) vertices. Then the sequence \(\{c_n\}\) satisfies a recurrence relation such that it provides a partition of \(n!\).
Youngmee Koh, Sangwook Ree
openaire +1 more source