Minimale \(n\)-fach kantenzusammenhängende Graphen
From MaRDI portal
Publication:2539992
DOI10.1007/BF01433466zbMath0198.29202OpenAlexW2057250066MaRDI QIDQ2539992
Publication date: 1971
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/162116
Related Items (88)
A survey on multi-loop networks. ⋮ Super Line-Connectivity Properties of Circulant Graphs ⋮ On edge-path eigenvalues of graphs ⋮ Matching preclusion for vertex-transitive networks ⋮ On the lower bound of \(k\)-maximal digraphs ⋮ Minimum 2-vertex strongly biconnected spanning directed subgraph problem ⋮ Large survivable nets and the generalized prisms ⋮ A bound on 4-restricted edge connectivity of graphs ⋮ On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs ⋮ On reconstruction of normal edge-transitive Cayley graphs ⋮ Bounding \(\ell\)-edge-connectivity in edge-connectivity ⋮ On restricted edge-connectivity of vertex-transitive multigraphs ⋮ The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks ⋮ On Vertices of Degree n in Minimally n-Edge-Connected Graphs ⋮ Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ On the spectrum of Wenger graphs ⋮ Embedded edge connectivity of \(k\)-ary \(n\)-cubes ⋮ On the connectivity of graphs in association schemes ⋮ On super 2-restricted and 3-restricted edge-connected vertex transitive graphs ⋮ Using semidirect products of groups to build classes of interconnection networks ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ Onk-Maximal Strength Digraphs ⋮ NOWHERE-ZERO -FLOWS IN TWO FAMILIES OF VERTEX-TRANSITIVE GRAPHS ⋮ The edge‐connectivity of vertex‐transitive hypergraphs ⋮ On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs ⋮ Super restricted edge connectivity of regular edge-transitive graphs ⋮ On the connectivity of \(p\)-diamond-free vertex transitive graphs ⋮ Nowhere-zero 3-flows in Cayley graphs on supersolvable groups ⋮ Super restricted edge connectivity of regular graphs with two orbits ⋮ On computing of a conditional edge connectivity of alternating group network ⋮ Codes from incidence matrices of graphs ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Quelques problèmes de connexite dans les graphes orientes ⋮ Indestructive deletions of edges from graphs ⋮ On the existence of super edge-connected graphs with prescribed degrees ⋮ Super \(s\)-restricted edge-connectivity of vertex-transitive graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Edge-connectivity of regular graphs with two orbits ⋮ Characterizations of strength extremal graphs ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ Extra edge connectivity and isoperimetric edge connectivity ⋮ Connectivity of half vertex transitive digraphs ⋮ Restricted connectivity for some interconnection networks ⋮ Super-connected edge transitive graphs ⋮ Tree connectivities of Cayley graphs on abelian groups with small degrees ⋮ Clique-inserted-graphs and spectral dynamics of clique-inserting ⋮ The connectivity of generalized graph products ⋮ A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph ⋮ Super restricted edge-connectivity of vertex-transitive graphs ⋮ Semi-hyper-connected edge transitive graphs ⋮ On super restricted edge-connectivity of edge-transitive graphs ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Simultaneous well-balanced orientations of graphs ⋮ Extremal infinite graph theory ⋮ On the edge-connectivity of graphs with two orbits of the same size ⋮ \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\) ⋮ Embedded connectivity of ternary \(n\)-cubes ⋮ On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs ⋮ 4-factor-criticality of vertex-transitive graphs ⋮ Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs ⋮ Graph theory ⋮ Atoms of cyclic edge connectivity in regular graphs ⋮ 3-Factor-Criticality of Vertex-Transitive Graphs ⋮ On k-minimally n-edge-connected graphs ⋮ Semi-hyper-connected vertex transitive graphs ⋮ Connectivity of vertex and edge transitive graphs ⋮ Unnamed Item ⋮ On the sizes of bi-\(k\)-maximal graphs ⋮ Super-connected arc-transitive digraphs ⋮ Unnamed Item ⋮ On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs ⋮ Efficient collective communciation in optical networks ⋮ Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs ⋮ On cyclic edge-connectivity of transitive graphs ⋮ Eigenvalues and edge-connectivity of regular graphs ⋮ Symmetric flows and broadcasting in hypercubes ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs ⋮ An edge extremal result for subcohesion ⋮ On minimally \((n,\lambda)\)-connected graphs ⋮ On the conditional edge connectivity of double-orbit graphs ⋮ Small separations in vertex-transitive graphs ⋮ On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs ⋮ Vertex-transitive graphs that have no Hamilton decomposition ⋮ Evolutionary local search for the edge-biconnectivity augmentation problem ⋮ Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs ⋮ The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
Cites Work
This page was built for publication: Minimale \(n\)-fach kantenzusammenhängende Graphen
