Cyclic Vertex Connectivity of Trivalent Cayley Graphs

Jenn-Yang KE  

IEICE TRANSACTIONS on Information and Systems   Vol.E101-D   No.7   pp.1828-1834
Publication Date: 2018/07/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2017EDP7334
Type of Manuscript: PAPER
Category: Fundamentals of Information Systems
interconnection network,  trivalent Cayley graphs,  fault-tolerance,  conditional connectivity,  cyclic vertex connectivity,  

Full Text: PDF(186.7KB)
>>Buy this Article

A vertex subset FV(G) is called a cyclic vertex-cut set of a connected graph G if G-F is disconnected such that at least two components in G-F contain cycles. The cyclic vertex connectivity is the cardinality of a minimum cyclic vertex-cut set. In this paper, we show that the cyclic vertex connectivity of the trivalent Cayley graphs TGn is equal to eight for n ≥ 4.