Generalized Connectivity of Graphs
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Random graphs (graph-theoretic aspects) (05C80)
Recommendations
- A solution to a conjecture on the generalized connectivity of graphs
- Note on the hardness of generalized connectivity
- Note on the generalized connectivity.
- Generalized connectivity of some total graphs
- Graphs with large generalized (edge-)connectivity
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- The generalized connectivity of the line graph and the total graph for the complete bipartite graph
- On the generalized (edge-)connectivity of graphs
- Generalized 3-edge-connectivity of Cartesian product graphs.
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Cited in
(67)- The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs
- On two generalized connectivities of graphs
- A result on the 3-generalized connectivity of a graph and its line graph
- The generalized 3-connectivity of graph products
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- The connectivity of generalized graph products
- Steiner tree packing number and tree connectivity
- The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
- The generalized connectivity of the line graph and the total graph for the complete bipartite graph
- The generalized 3-connectivity of the Mycielskian of a graph
- Strong subgraph connectivity of digraphs
- The 3-path-connectivity of the hypercubes
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- Generalized 4-connectivity of hierarchical star networks
- The generalized 4-connectivity of pancake graphs
- Extremal results for directed tree connectivity
- Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs
- Path 3-(edge-)connectivity of lexicographic product graphs
- Using semidirect products of groups to build classes of interconnection networks
- The \(\kappa_k\)-connectivity of line graphs
- The reliability analysis based on the generalized connectivity in balanced hypercubes
- The minimum size of a graph with given tree connectivity
- \(k\)-tree connectivity of line graphs
- The g-component connectivity of graphs
- Two lower bounds for generalized 3-connectivity of Cartesian product graphs
- A tutorial on the balanced minimum evolution problem
- Reliability assessment of the divide-and-swap cube in terms of generalized connectivity
- Packing strong subgraph in digraphs
- Component connectivity of generalized Petersen graphs
- scientific article; zbMATH DE number 3867370 (Why is no real title available?)
- Separation of Cartesian products of graphs on several connected components by the removal of edges
- Algorithmic Aspects of Graph Connectivity
- Connectivity of the generalised Mycielskian of digraphs
- scientific article; zbMATH DE number 4012656 (Why is no real title available?)
- scientific article; zbMATH DE number 1747384 (Why is no real title available?)
- Generalising connected components
- Generalized connectivity of some total graphs
- Connectivity of communication networks
- Connectivity of the generalized hierarchical product of graphs
- The generalized connectivity of data center networks
- A solution to a conjecture on the generalized connectivity of graphs
- Constructing internally disjoint pendant Steiner trees in Cartesian product networks
- A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs
- Directed Steiner tree packing and directed tree connectivity
- Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
- Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks
- A survey on rainbow (vertex-)index of graphs
- Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes
- On the minimum size of graphs with given generalized connectivity
- The 4-set tree connectivity of hierarchical folded hypercube
- Directed cycle k-connectivity of complete digraphs and complete regular bipartite digraphs
- The pendant-tree connectivity of some regular graphs
- The directed pendant-tree 3-connectivity of symmetric compositions
- The path-connectivity of hierarchical cubic networks
- Bounds of generalized edge-connectivity of lexicographic product graphs
- A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs
- Constructing disjoint Steiner trees in Sierpiński graphs
- h-extra l-component connectivity of graphs and digraphs with minimum distance spectral radii
- \(k\)-path-connectivity of the complete balanced tripartite graph \(K_{n, n, n}\) for \(n + 1 \leq k \leq 2 n - 4\)
- The 4-set tree connectivity of folded hypercube
- Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs
- k-path-edge-connectivity of the complete balanced bipartite graph
- Perfect out-forest problem and directed Steiner cycle packing problem
- The \((k,\ell )\)-proper index of graphs
- The generalized 4-connectivity of bubble-sort graphs
- Path connectivity of \(k\)-generalized projectors
This page was built for publication: Generalized Connectivity of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2991965)
