A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs
The generalized k-connectivity κk(G) of a graph G, mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G...
Main Author: | Sun Yuefang |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2017-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1982 |
Similar Items
-
Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs
by: Sun Yuefang
Published: (2016-11-01) -
Graphs with Large Generalized (Edge-)Connectivity
by: Li Xueliang, et al.
Published: (2016-11-01) -
Graphs with Strong Proper Connection Numbers and Large Cliques
by: Yingbin Ma, et al.
Published: (2023-04-01) -
Generalized connectivity in cubic fuzzy graphs with application in the trade deficit problem
by: Yongsheng Rao, et al.
Published: (2024-03-01) -
Strong Edge Coloring of Generalized Petersen Graphs
by: Ming Chen, et al.
Published: (2020-08-01)