scientific article; zbMATH DE number 30760

MaRDI QIDQ3987052zbMATH OpenFDO

Authors Ortrud R. Oellermann, H. C. Swart, David Day

Publication date 28 June 1992

zbMATH Keywords

caterpillarsconnectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Bounding \(\ell\)-edge-connectivity in edge-connectivity
• scientific article; zbMATH DE number 4070940
• Characterization of minimally (2,l)-connected graphs
• Minimally (k, k)‐edge‐connected graphs
• ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs

Cited in

(15)

• On the \(l\)-connectivity of a digraph
• On two generalized connectivities of graphs
• The 4-component connectivity of alternating group networks
• Constructing edge-disjoint Steiner paths in lexicographic product networks
• Separation of Cartesian products of graphs into several connected components by the removal of vertices
• The g-component connectivity of graphs
• On the maximum and minimum sizes of a graph with given \(k\)-connectivity
• A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
• Sharp upper bounds for generalized edge-connectivity of product graphs
• Graphs with large generalized (edge-)connectivity
• The largest Laplacian and adjacency indices of complete caterpillars of fixed diameter
• scientific article; zbMATH DE number 4070940 (Why is no real title available?)
• On the difference of two generalized connectivities of a graph
• h-extra l-component connectivity of graphs and digraphs with minimum distance spectral radii
• On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987052)