Article citationsMore>>

Day, D.P., Oellermann, O.R. and Swart, H.C. (1999) Bounds on the Size of Graphs of Given Order and l-Connectivity. Discrete Mathematics, 197, 217-223.
https://doi.org/10.1016/S0012-365X(99)90067-5

has been cited by the following article:

• TITLE: The g-Component Connectivity of Some Networks

  AUTHORS: Ganghua Xie, Yinkui Li

  KEYWORDS: g-Component Connectivity, Mycielskian Graph, The Fault Tolerance of Networks

  JOURNAL NAME: Open Journal of Applied Sciences, Vol.13 No.12, December 29, 2023

  ABSTRACT: In 2012, Hsu et al. generalized the classical connectivity of graph G and introduced the concept of g-component connectivity CKg(G) to measure the fault tolerance of networks. In this paper, we determine the g-component connectivity of some graphs, such as fan graph, helm graph, crown graph, Gear graph and the Mycielskian graph of star graph and complete bipartite graph.