The following pages link to (Q3490015):
Displaying 43 items.
- New improvements on connectivity of cages (Q546369) (← links)
- Diameter, short paths and superconnectivity in digraphs (Q704288) (← links)
- A new bound for the connectivity of cages (Q712582) (← links)
- On the restricted connectivity and superconnectivity in graphs with given girth (Q868327) (← links)
- Lower connectivities of regular graphs with small diameter (Q878612) (← links)
- On the connectivity of cages with girth five, six and eight (Q878639) (← links)
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter (Q918987) (← links)
- On the connectivity of \((k,g)\)-cages of even girth (Q932601) (← links)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey (Q932603) (← links)
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs (Q932676) (← links)
- Connectivity measures in matched sum graphs (Q952660) (← links)
- Edge fault tolerance analysis of super \(k\)-restricted connected networks (Q963934) (← links)
- On the connectivity and superconnected graphs with small diameter (Q968157) (← links)
- On the girth of extremal graphs without shortest cycles (Q998448) (← links)
- On super edge-connectivity of product graphs (Q1002278) (← links)
- Diameter-sufficient conditions for a graph to be super-restricted connected (Q1005222) (← links)
- Sufficient conditions for super-arc-strongly connected oriented graphs (Q1015435) (← links)
- Superconnectivity of regular graphs with small diameter (Q1028102) (← links)
- On the 3-restricted edge connectivity of permutation graphs (Q1028132) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Superconnectivity of bipartite digraphs and graphs (Q1292813) (← links)
- Extraconnectivity of \(s\)-geodetic digraphs and graphs (Q1296969) (← links)
- The superconnectivity of large digraphs and graphs (Q1313826) (← links)
- Extraconnectivity of graphs with large girth (Q1322225) (← links)
- On the distance connectivity of graphs and digraphs (Q1322268) (← links)
- Extraconnectivity of graphs with large minimum degree and girth (Q1356447) (← links)
- On the order and size of \(s\)-geodetic digraphs with given connectivity (Q1377819) (← links)
- Connectivity of large bipartite digraphs and graphs (Q1377820) (← links)
- Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs (Q1402063) (← links)
- Diameter vulnerability of iterated line digraphs (Q1910577) (← links)
- On the extraconnectivity of graphs (Q1923481) (← links)
- Bipartite graphs and digraphs with maximum connectivity (Q1923586) (← links)
- Edge-connectivity and edge-superconnectivity in sequence graphs (Q2384389) (← links)
- Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages (Q2568484) (← links)
- On the Superconnectivity in graphs with odd girth g and even girth h (Q2851513) (← links)
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions (Q2913947) (← links)
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors (Q3005114) (← links)
- On super connectivity of Cartesian product graphs (Q3528152) (← links)
- Superconnected digraphs and graphs with small conditional diameters (Q4537622) (← links)
- The super edge connectivity of Kronecker product graphs (Q4553888) (← links)
- (Q4659601) (← links)
- Connectedness of digraphs and graphs under constraints on the conditional diameter (Q4667716) (← links)
- On restricted connectivities of permutation graphs (Q4680413) (← links)
