✦ LIBER ✦

-edge-fault-tolerant weak-pancyclicity of -star graphs

✍ Scribed by Duh, Dyi-Rong; Chen, Tzu-Lung; Wang, Yue-Li

Book ID: 122197889
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 835 KB
Volume: 516
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.11.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-fault-tolerant pancyclicity of alte

Edge-fault-tolerant pancyclicity of alternating group graphs

✍ Ping-Ying Tsai; Gen-Huey Chen; Jung-Sheng Fu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

Fault tolerance of edge pancyclicity in

Fault tolerance of edge pancyclicity in alternating group graphs

✍ Andrzej Szepietowski 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 444 KB

Edge-fault-tolerant panconnectivity and

Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph

✍ Chen, Xie-Bin 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Fault-tolerant edge-pancyclicity of loca

Fault-tolerant edge-pancyclicity of locally twisted cubes

✍ Xirong Xu; Wenhua Zhai; Jun-Ming Xu; Aihua Deng; Yuansheng Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 432 KB

Panconnectivity and edge-fault-tolerant

Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes

✍ Meijie Ma; Guizhen Liu; Jun-Ming Xu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 312 KB

As an enhancement on the hypercube Q n , the augmented cube AQ n , proposed by Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks, 40(2) (2002), 71-84], not only retains some of the favorable properties of Q n but also possesses some embedding properties that Q n does not. For

Faithful 1-edge fault tolerant graphs

✍ Shih-Yih Wang; Lih-Hsing Hsu; Ting-Yi Sung 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 726 KB

A graph G\* is l-edge fault tolerant with respect to a graph G, denoted by I-EFT( G), if any graph obtained by removing an edge from G' contains G. A l-Em(G) graph is said to be optimal if it contains the minimum number of edges among all I-EFT( G) graphs. Let Gf be 1 -EJ!T( Gi) for i = 1,2. It can