The \(g\)-component connectivity of graphs

DOI10.1016/j.tcs.2021.07.039OpenAlexW3188952728MaRDI QIDQ2232610

Shuming Zhou, He Li, Chengfu Ye, Shu-Min Zhang

Publication date: 6 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.07.039

zbMATH Keywords

connectivityextremal problem\(g\)-component connectivity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relationship between extra edge connectivity and component edge connectivity for regular graphs
• On the \(\ell\)-connectivity of a graph
• Bounds on the size of graphs of given order and \(l\)-connectivity
• Two kinds of generalized connectivity of dual cubes
• Conditional connectivity of folded hypercubes
• The 4-component connectivity of alternating group networks
• Some extremal results on the colorful monochromatic vertex-connectivity of a graph
• On minimally rainbow \(k\)-connected graphs
• Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
• The component (edge) connectivity of shuffle-cubes
• On the \(g\)-good-neighbor connectivity of graphs
• Erdős-Gallai-type results for total monochromatic connection of graphs
• Component connectivity of the hypercubes
• Conditional connectivity
• On Component Connectivity of Hierarchical Star Networks
• Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks

This page was built for publication: The \(g\)-component connectivity of graphs