For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Cyclic Vertex Connectivity of Trivalent Cayley Graphs
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2018/07/01
Online ISSN: 1745-1361
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 F ⊆ V(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.