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

DOI10.1016/0020-0255(78)90041-5zbMath0417.05041OpenAlexW1972985839MaRDI QIDQ754894

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

algorithmsymmetric graphstrong connectivitysubgraphsmaximal minimally strongly connectedminimally strongly connected

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Sequential Algorithm for the Determination of Maximum Compatibles
• Analysis of Graphs by Connectivity Considerations
• Boolean Algebra, Map Coloring, and Interconnections
• On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph

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