Connectivity of the graph induced by contractible edges of a k-tree

Chengfu Qin, Litao Guo and Lexian Huang

Applied Mathematics and Computation, 2019, vol. 353, issue C, 1-6

Abstract: A k-tree is a Kk+1 or a graph on at least k+2 vertices obtained from a smaller k-tree by adding one vertex and joining it to the vertices of a k-clique. Let G be a k-connected graph, and let e be an edge of G. The edge e is said to be contractible if the graph obtained from G by contracting e is again a k-connected graph, otherwise it is said to be non-contractible. Let G be a k-tree, and let Gc=(V(G),EC(G)), where EC(G) denotes the set of all contractible edges of G. In this paper, we prove that κ(Gc)=δ(Gc). Further, Gc is super connected, whenever 3 ≤ δ(Gc) < k.

Keywords: k-tree; Edges; Induced graph; Connectivity (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319300669
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:353:y:2019:i:c:p:1-6

DOI: 10.1016/j.amc.2019.01.051

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