Pages that link to "Item:Q3216689"
From MaRDI portal
The following pages link to Connectivity of Regular Directed Graphs with Small Diameters (Q3216689):
Displaying 45 items.
- The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks (Q418321) (← links)
- Radial Moore graphs of radius three (Q427891) (← links)
- Efficient twin domination in generalized de Bruijn digraphs (Q482195) (← links)
- On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) (Q533438) (← links)
- Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) (Q617642) (← links)
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs (Q621581) (← links)
- Connectivity of Kautz networks (Q685656) (← links)
- Lower bounds on the vertex-connectivity of digraphs and graphs (Q845669) (← links)
- Isomorphic factorization, the Kronecker product and the line digraph (Q845899) (← links)
- Connectivity of graphs with given girth pair (Q864156) (← links)
- Lower connectivities of regular graphs with small diameter (Q878612) (← links)
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter (Q918987) (← links)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey (Q932603) (← links)
- On the connectivity and superconnected graphs with small diameter (Q968157) (← links)
- The twin domination number in generalized de Bruijn digraphs (Q989508) (← links)
- On the girth of extremal graphs without shortest cycles (Q998448) (← links)
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) (Q1026123) (← links)
- Degree sequence conditions for maximally edge-connected oriented graphs (Q1031725) (← links)
- Sufficient conditions for maximally connected dense graphs (Q1086585) (← links)
- On the connectivity of the De Bruijn graph (Q1105619) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Fault-tolerant routings in Kautz and de Bruijn networks (Q1123801) (← links)
- Connectivity of consecutive-\(d\) digraphs (Q1199422) (← links)
- Super edge-connectivity of dense digraphs and graphs (Q1199454) (← links)
- An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph (Q1210232) (← links)
- Superconnectivity of bipartite digraphs and graphs (Q1292813) (← links)
- The superconnectivity of large digraphs and graphs (Q1313826) (← links)
- On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks (Q1351611) (← links)
- Connectivity of large bipartite digraphs and graphs (Q1377820) (← links)
- Super line-connectivity of consecutive-\(d\) digraphs (Q1382814) (← links)
- Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks (Q1392538) (← links)
- Factorization of de Bruijn digraphs by cycle-rooted trees (Q1603418) (← links)
- Distance domination of generalized de Bruijn and Kautz digraphs (Q1692700) (← links)
- On the number of cycles in generalized Kautz digraphs (Q1877656) (← links)
- An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs (Q1897350) (← links)
- Extension of de Bruijn graph and Kautz graph (Q1903209) (← links)
- Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II (Q1917254) (← links)
- Trade-offs among degree, diameter, and number of paths (Q2112655) (← links)
- Constructing the minimum dominating sets of generalized de Bruijn digraphs (Q2342640) (← links)
- On the edge-connectivity and restricted edge-connectivity of a product of graphs (Q2462383) (← links)
- On the Superconnectivity in graphs with odd girth g and even girth h (Q2851513) (← links)
- Twin domination in generalized Kautz digraphs (Q3014589) (← links)
- On the connectivity of semiregular cages (Q3057169) (← links)
- Edge-superconnectivity of semiregular cages with odd girth (Q3100699) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
