Maximally connected digraphs
From MaRDI portal
Recommendations
Cites work
Cited in
(83)- Connectedness of digraphs and graphs under constraints on the conditional diameter
- On the distance connectivity of graphs and digraphs
- Every Cubic Cage is quasi 4-connected
- On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\)
- Neighborhood and degree conditions for super-edge-connected bipartite digraphs
- scientific article; zbMATH DE number 4162905 (Why is no real title available?)
- Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
- Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
- Connectivity of graphs with given girth pair
- New improvements on connectivity of cages
- On local connectivity of graphs
- Codes from incidence matrices of graphs
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Diameter, short paths and superconnectivity in digraphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On the connectivity of \((k,g)\)-cages of even girth
- Restricted arc-connectivity of generalized \(p\)-cycles
- Local-edge-connectivity in digraphs and oriented graphs
- A new bound for the connectivity of cages
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Common consequents in directed graphs
- The spectra of some families of digraphs
- Small cutsets in quasiminimal Cayley graphs
- Containment of butterflies in networks constructed by the line digraph operation
- Connectivity of iterated line graphs
- On connectivity of the cartesian product of two graphs
- The superconnectivity of large digraphs and graphs
- Extraconnectivity of graphs with large girth
- Super edge-connectivity of dense digraphs and graphs
- Connectivity of large bipartite digraphs and graphs
- scientific article; zbMATH DE number 927075 (Why is no real title available?)
- On the order and size of s-geodetic digraphs with given connectivity
- The diameter of cyclic Kautz digraphs
- Diameter and connectivity of (D; g)-cages
- On the girth of extremal graphs without shortest cycles
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- On the connectivity of \(p\)-diamond-free graphs
- Bipartite graphs and digraphs with maximum connectivity
- Disjoint paths of bounded length in large generalized cycles
- Arc fault tolerance of Kautz digraphs
- Vosperian and superconnected abelian Cayley digraphs
- Minimum arc-cuts of normally regular digraphs and Deza digraphs
- Super edge-connectivity of de Bruijn and Kautz undirected graphs
- On the acyclic disconnection and the girth
- On average connectivity of the strong product of graphs
- On the extraconnectivity of graphs
- Superconnectivity of bipartite digraphs and graphs
- Maximally edge-connected graphs and zeroth-order general Randić index for -1
- Lower connectivities of regular graphs with small diameter
- Nonplanarity of iterated line graphs
- Lower bounds on the vertex-connectivity of digraphs and graphs
- Sufficient conditions for super-arc-strongly connected oriented graphs
- New cyclic Kautz digraphs with optimal diameter
- Queue layouts of iterated line directed graphs
- The underlying graph of a line digraph
- Minimum cuts of distance-regular digraphs
- Distance formula and shortest paths for the \((n,k)\)-star graphs
- Graphs and algorithms in communication networks on seven league boots
- Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
- Graphs, friends and acquaintances
- On the number of components of \((k,g)\)-cages after vertex deletion
- Maximally and super connected multisplit graphs and digraphs
- On the connectivity of semiregular cages
- On the connectivity and superconnected graphs with small diameter
- Superconnectivity of regular graphs with small diameter
- Partial line directed hypergraphs
- Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
- Edge-connectivity and edge-superconnectivity in sequence graphs
- Diameter vulnerability of iterated line digraphs
- Every cubic cage is quasi 4-connected
- On local connectivity of graphs with given clique number
- On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)
- Connectivity and fault-tolerance of hyperdigraphs
- On the connectivity of cages with girth five, six and eight
- New results on connectivity of cages
- Miscellaneous digraph classes
- Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
- The number of shortest paths in the (n, k)-star graph
- Extraconnectivity of \(s\)-geodetic digraphs and graphs
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
- The connectivity of large digraphs and graphs
- Superconnected digraphs and graphs with small conditional diameters
- Extraconnectivity of graphs with large minimum degree and girth
This page was built for publication: Maximally connected digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4206749)
