Arc connectivity of transformation digraph Dxyz*. (3rd March 2016)

• Record Type: Journal Article
• Authors: Li, Jing-Jing; Liu, Juan
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 2(2016)
• Page Start: 231
• Page End: 239
• Publication Date: 2016-03-03
• Subjects: Total transformation digraphs -- arc connectivity -- max-λ; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2014.943404
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A simple digraph D (without loops and multiple arcs)is said to be super-arc-connected if every minimum arc-cut is the out-neighbor set or in-neighbor set of a vertex. In this paper, we investigate the arc connectivity of these ten kinds of new total transformation digraphs associate with symbol '0'.