On complexity of substructure connectivity and restricted connectivity of graphs

Key Points

• Substructure connectivity in graphs determines how easily different parts connect, influencing overall graph performance.
• Key properties were assessed for graphs with various vertex arrangements and link structures, identifying significant patterns.
• Computational techniques were used to evaluate the connectivity properties, highlighting the complexities involved in graph analysis.
• These findings may enable advancements in understanding connectivity within complex networks, highlighting new research avenues.