The generalized connectivity of the line graph and the total graph for the complete bipartite graph

Yinkui Li, Ruijuan Gu and Hui Lei

Applied Mathematics and Computation, 2019, vol. 347, issue C, 645-652

Abstract: The generalized k-connectivity κk(G) of a graph G, introduced by Hager (1985), is a natural generalization of the concept of connectivity κ(G), which is just for k=2. This parameter is often used to measure the capability of a network G to connect any k vertices in G. The line graph and the total graph are usually seen as important models for interconnection networks. In this paper, we determine the generalized 3-(edge-)connectivity of the line graph and the total graphs of the complete bipartite graph and discuss the bound for generalized 3-connectivity of the total graphs.

Keywords: The generalized 3(-edge)-connectivity; The line graph; The total graph; The complete bipartite graph (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318310129
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:347:y:2019:i:c:p:645-652

DOI: 10.1016/j.amc.2018.11.038

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 ().