Extraconnectivity of graphs with large girth

From MaRDI portal
Revision as of 12:21, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1322225

DOI10.1016/0012-365X(92)00475-7zbMath0797.05058OpenAlexW1980395362MaRDI QIDQ1322225

J. Fàbrega, Miquel Àngel Fiol

Publication date: 5 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00475-7




Related Items (87)

On \(g\)-extra connectivity of hypercube-like networksToughness of the corona of two graphsA sufficient condition for graphs to be super \(k\)-restricted edge connectedEdge fault tolerance analysis of a class of interconnection networksParallel routing in regular networks with faultsOn the reliability of generalized Petersen graphsSufficient conditions for \(k\)-restricted edge connected graphsFault-tolerant analysis of a class of networksDisconnecting strongly regular graphsReliability evaluation of modified bubble-sort graph networks based on structure fault patternAn anti-Ramsey theorem of \(k\)-restricted edge-cutsBounds for the Super Extra Edge Connectivity of Graphs\(\{2,3\}\)-extraconnectivities of hypercube-like networksOn extra connectivity and extra edge-connectivity of balanced hypercubesOn the restricted connectivity and superconnectivity in graphs with given girthConnectivity and diagnosability of center \(k\)-ary \(n\)-cubesEdge-disjoint paths in faulty augmented cubesA new approach to finding the extra connectivity of graphsOn \(g\)-good-neighbor conditional connectivity and diagnosability of hierarchical star networksOn the super‐restricted arc‐connectivity of s ‐geodetic digraphsOn the restricted arc-connectivity of \(s\)-geodetic digraphsOn the extraconnectivity of graphsA kind of conditional fault tolerance of alternating group graphsOn maximal 3-restricted edge connectivity and reliability analysis of hypercube networksOn reliability of the folded hypercubesThe largest component of faulty star graphsOptimally restricted edge connected elementary Harary graphsVulnerability of super edge-connected networksConnectivity for some families of composition networksFault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubesSufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connectedOn the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphsOn super 2-restricted and 3-restricted edge-connected vertex transitive graphsTwo kinds of conditional connectivity of hypercubesOn extra connectivity and extra edge-connectivity of balanced hypercubesEdge fault tolerance of graphs with respect to super edge connectivityConcentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges\( R_3\)-connectivity of folded hypercubes\(\{2,3\}\)-restricted connectivity of locally twisted cubesStructure fault tolerance of balanced hypercubesExtraconnectivity of \(k\)-ary \(n\)-cube networksSufficient conditions for maximally restricted edge connected graphsOn super connectivity of Cartesian product graphsEdge fault tolerance of super edge connectivity for three families of interconnection networksA sufficient condition for graphs to be \(\lambda_k\)-optimal3-extra connectivity of 3-ary \(n\)-cube networksSufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connectedSuper \(s\)-restricted edge-connectivity of vertex-transitive graphsMaximally edge-connected and vertex-connected graphs and digraphs: A surveyDiameter-girth sufficient conditions for optimal extraconnectivity in graphs\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphsVertex-transitive graphs that remain connected after failure of a vertex and its neighborsA kind of conditional connectivity of Cayley graphs generated by unicyclic graphsFault-free Hamiltonian cycles in crossed cubes with conditional link faultsK-restricted edge connectivity for some interconnection networksOn \(g\)-extra connectivity of folded hypercubesOn the complexity of computing the \(k\)-restricted edge-connectivity of a graphThe \(k\)-restricted edge-connectivity of the data center network DCellStructure and substructure connectivity of balanced hypercubes\(h\)-restricted connectivity of locally twisted cubesOn conditional diagnosability of the folded hypercubesEdge fault tolerance of interconnection networks with respect to maximally edge-connectivityEdge fault tolerance analysis of super \(k\)-restricted connected networksSufficient conditions for \(\lambda _k\)-optimality in triangle-free graphsThe existence and upper bound for two types of restricted connectivityThe \(p\)-restricted edge-connectivity of Kneser graphsVulnerability of super extra edge-connected graphsA general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)Unnamed ItemSufficient conditions for a graph to be λ k -optimal with given girth and diameterVertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs4-factor-criticality of vertex-transitive graphsOn the \(g\)-good-neighbor connectivity of graphsUnnamed ItemSpectral threshold for extremal cyclic edge-connectivityDegree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)On the Complexity of Computing the k-restricted Edge-connectivity of a GraphOn the 3-restricted edge connectivity of permutation graphsMinimally 3-restricted edge connected graphsA neighborhood condition for graphs to be maximally \(k\)-restricted edge connected3-restricted connectivity of graphs with given girthThe \(h\)-extra connectivity of \(k\)-ary \(n\)-cubesSufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connectedCharacterization of component diagnosability of regular networksThe extra connectivity of the enhanced hypercubesOn the conditional edge connectivity of double-orbit graphsRealizability of fault-tolerant graphs




Cites Work




This page was built for publication: Extraconnectivity of graphs with large girth