scientific article
From MaRDI portal
Publication:3490015
zbMath0708.05025MaRDI QIDQ3490015
J. Fàbrega, Miguel Escudero, Miquel Àngel Fiol
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (42)
Superconnected digraphs and graphs with small conditional diameters ⋮ Edge-connectivity and edge-superconnectivity in sequence graphs ⋮ Extraconnectivity of graphs with large minimum degree and girth ⋮ Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions ⋮ The super edge connectivity of Kronecker product graphs ⋮ Diameter vulnerability of iterated line digraphs ⋮ On the restricted connectivity and superconnectivity in graphs with given girth ⋮ Large fault-tolerant interconnection networks ⋮ On the order and size of \(s\)-geodetic digraphs with given connectivity ⋮ Connectivity of large bipartite digraphs and graphs ⋮ Lower connectivities of regular graphs with small diameter ⋮ On the connectivity of cages with girth five, six and eight ⋮ On the extraconnectivity of graphs ⋮ Bipartite graphs and digraphs with maximum connectivity ⋮ Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs ⋮ On super connectivity of Cartesian product graphs ⋮ Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter ⋮ On the connectivity of \((k,g)\)-cages of even girth ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Diameter-girth sufficient conditions for optimal extraconnectivity in graphs ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ Connectivity measures in matched sum graphs ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ On the connectivity and superconnected graphs with small diameter ⋮ New improvements on connectivity of cages ⋮ Connectedness of digraphs and graphs under constraints on the conditional diameter ⋮ Diameter, short paths and superconnectivity in digraphs ⋮ A new bound for the connectivity of cages ⋮ On restricted connectivities of permutation graphs ⋮ On the girth of extremal graphs without shortest cycles ⋮ On super edge-connectivity of product graphs ⋮ Diameter-sufficient conditions for a graph to be super-restricted connected ⋮ Sufficient conditions for super-arc-strongly connected oriented graphs ⋮ Superconnectivity of regular graphs with small diameter ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages ⋮ Extraconnectivity of \(s\)-geodetic digraphs and graphs ⋮ On the Superconnectivity in graphs with odd girth g and even girth h ⋮ The superconnectivity of large digraphs and graphs ⋮ Extraconnectivity of graphs with large girth ⋮ On the distance connectivity of graphs and digraphs
This page was built for publication:
