Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs

DOI10.1016/0020-0255(78)90041-5MaRDI QIDQ754894zbMATH OpenOpenAlexFDO

Authors C. L. Sheng, Sunil R. Das

Publication date 1978

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(78)90041-5

zbMATH Keywords

algorithmmaximal minimally strongly connectedminimally strongly connectedstrong connectivitysubgraphssymmetric graph

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Connectivity (05C40)

Cites work

• Analysis of Graphs by Connectivity Considerations
• Boolean Algebra, Map Coloring, and Interconnections
• scientific article; zbMATH DE number 3167398 (Why is no real title available?)
• On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph
• Parallel concepts in graph theory
• Sequential Algorithm for the Determination of Maximum Compatibles

Cited in

(3)

• Super \(\lambda_3\)-optimality of regular graphs
• Super p-restricted edge connectivity of line graphs
• On reliability of the folded hypercubes

This page was built for publication: Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs

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