The generalized 3-connectivity of graph products

Hengzhe Li, Yingbin Ma, Weihua Yang and Yifei Wang

Applied Mathematics and Computation, 2017, vol. 295, issue C, 77-83

Abstract: The generalized k-connectivity κk(G) of a graph G, which was introduced by Chartrand et al. (1984), is a generalization of the concept of vertex connectivity. For this generalization, the generalized 2-connectivity κ2(G) of a graph G is exactly the connectivity κ(G) of G. In this paper, let G be a connected graph of order n and let H be a 2-connected graph. For Cartesian product, we show that κ3(G□H)≥κ3(G)+1 if κ(G)=κ3(G); κ3(G□H)≥κ3(G)+2 if κ(G) > κ3(G). Moreover, above bounds are sharp. As an example, we show that κ3(Cn1□Cn2□⋯Cnk︷k)=2k−1, where Cni is a cycle. For lexicographic product, we prove that κ3(H∘G)≥max{3δ(G)+1,⌈3n+12⌉} if δ(G)<2n−13, and κ3(H∘G)=2n if δ(G)≥2n−13.

Keywords: Connectivity; Generalized connectivity; Cartesian product; Lexicographic product (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316306002
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:295:y:2017:i:c:p:77-83

DOI: 10.1016/j.amc.2016.10.002

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().