Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected. (22nd February 2021)

• Record Type: Journal Article
• Authors: Hong, Zhen-Mu; Xia, Zheng-Jiang; Chen, Fuyuan; Volkmann, Lutz
• Other Names: Uddin M. Irfan Academic Editor.
• Is Part Of: Complexity. Volume 2021(2021)
• Publication Date: 2021-02-22
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2021/5588146
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : Let G be a connected graph with minimum degree δ G and vertex-connectivity κ G . The graph G is k -connected if κ G ≥ k, maximally connected if κ G = δ G, and super-connected if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we present sufficient conditions for a graph with given minimum degree to be k -connected, maximally connected, or super-connected in terms of the number of edges, the spectral radius of the graph, and its complement, respectively. Analogous results for triangle-free graphs with given minimum degree to be k -connected, maximally connected, or super-connected are also presented.