Maximally connected digraphs
From MaRDI portal
Publication:4206749
DOI10.1002/jgt.3190130603zbMath0688.05029OpenAlexW2148350285MaRDI QIDQ4206749
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130603
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (78)
Containment of butterflies in networks constructed by the line digraph operation ⋮ Neighborhood and degree conditions for super-edge-connected bipartite digraphs ⋮ Partial line directed hypergraphs ⋮ Superconnected digraphs and graphs with small conditional diameters ⋮ Minimum arc-cuts of normally regular digraphs and Deza digraphs ⋮ Connectivity and fault-tolerance of hyperdigraphs ⋮ Lower bounds on the vertex-connectivity of digraphs and graphs ⋮ Edge-connectivity and edge-superconnectivity in sequence graphs ⋮ Extraconnectivity of graphs with large minimum degree and girth ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Connectivity of graphs with given girth pair ⋮ Diameter vulnerability of iterated line digraphs ⋮ The number of shortest paths in the (n, k)-star graph ⋮ On the order and size of \(s\)-geodetic digraphs with given connectivity ⋮ Connectivity of large bipartite digraphs and graphs ⋮ The spectra of some families of digraphs ⋮ Lower connectivities of regular graphs with small diameter ⋮ On the connectivity of cages with girth five, six and eight ⋮ Small cutsets in quasiminimal Cayley graphs ⋮ On the extraconnectivity of graphs ⋮ Bipartite graphs and digraphs with maximum connectivity ⋮ Minimum cuts of distance-regular digraphs ⋮ Queue layouts of iterated line directed graphs ⋮ Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ Restricted arc-connectivity of generalized \(p\)-cycles ⋮ Codes from incidence matrices of graphs ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\) ⋮ Unnamed Item ⋮ On average connectivity of the strong product of graphs ⋮ The diameter of cyclic Kautz digraphs ⋮ Vosperian and superconnected abelian Cayley digraphs ⋮ On the connectivity of \((k,g)\)-cages of even girth ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Nonplanarity of iterated line graphs ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ Local-edge-connectivity in digraphs and oriented graphs ⋮ Diameter and connectivity of (D; g)-cages ⋮ On local connectivity of graphs ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ The underlying graph of a line digraph ⋮ Connectivity of iterated line graphs ⋮ On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) ⋮ On the connectivity and superconnected graphs with small diameter ⋮ New improvements on connectivity of cages ⋮ Unnamed Item ⋮ Connectedness of digraphs and graphs under constraints on the conditional diameter ⋮ Diameter, short paths and superconnectivity in digraphs ⋮ Super edge-connectivity of de Bruijn and Kautz undirected graphs ⋮ Distance formula and shortest paths for the \((n,k)\)-star graphs ⋮ A new bound for the connectivity of cages ⋮ On local connectivity of graphs with given clique number ⋮ On the connectivity of semiregular cages ⋮ On the girth of extremal graphs without shortest cycles ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\) ⋮ Diameter-sufficient conditions for a graph to be super-restricted connected ⋮ Sufficient conditions for super-arc-strongly connected oriented graphs ⋮ Every cubic cage is quasi 4-connected ⋮ The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) ⋮ On the number of components of \((k,g)\)-cages after vertex deletion ⋮ Superconnectivity of regular graphs with small diameter ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ Disjoint paths of bounded length in large generalized cycles ⋮ On the connectivity of \(p\)-diamond-free graphs ⋮ On connectivity of the cartesian product of two graphs ⋮ Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages ⋮ Extraconnectivity of \(s\)-geodetic digraphs and graphs ⋮ Miscellaneous Digraph Classes ⋮ On the Superconnectivity in graphs with odd girth g and even girth h ⋮ Graphs, friends and acquaintances ⋮ On the acyclic disconnection and the girth ⋮ Every Cubic Cage is quasi 4-connected ⋮ The superconnectivity of large digraphs and graphs ⋮ Extraconnectivity of graphs with large girth ⋮ On the distance connectivity of graphs and digraphs ⋮ Arc fault tolerance of Kautz digraphs
Cites Work
This page was built for publication: Maximally connected digraphs
