TY - JOUR
AU - Shiying Wang, Zhenhua Wang, Mujiangshan Wang
AB - Connectivity plays an important role in measuring the fault tolerance of interconnection networks G = ( V , E ) G=(V,E) . A faulty set F ⊆ V F⊆V is called a g -extra faulty set if every component of G − F has more than g nodes. A g -extra cut of G is a g -extra faulty set F such that G − F is disconnected. The minimum cardinality of g -extra cuts is said to be the g -extra connectivity of G . Diagnosability is an important metric for measuring the reliability of G . A new measure for fault diagnosis of G restrains that every fault-free component has at least ( g + 1 ) (g+1) fault-free nodes, which is called the g -extra diagnosability of G . As a favorable topology structure of interconnection networks, the n -dimensional bubble-sort star graph BS n has many good properties. In this paper, we prove that 2-extra connectivity of BS n is 6 n − 15 6n−15 for n ≥ 5 n≥5 and the 2-extra connectivity of BS 4 is 8; the 2-extra diagnosability of BS n is 6 n − 13 6n−13 under the PMC model for n ≥ 5 n≥5 and the 2-extra diagnosability of BS n is 6 n − 13 6n−13 under the MM * model for n ≥ 6 n≥6 . Key words interconnection network graph connectivity diagnosability PMC model MM * model bubble-sort star graph © The British Computer Society 2016. All rights reserved. For Permissions, please email: journals.permissions@oup.com « Previous | Next Article » Table of Contents This Article The Computer Journal (2016) 59 (12): 1839-1856. doi: 10.1093/comjnl/bxw037 First published online: July 29, 2016 » Abstract Free Full Text (HTML) Free Full Text (PDF) Free All Versions of this Article: bxw037v1 59/12/1839 most recent Classifications Section A: Computer Science Theory, Methods and Tools Original Articles Services Article metrics Alert me when cited Alert me if corrected Find similar articles Similar articles in Web of Science Add to my archive Download citation Request Permissions Citing Articles Load citing article information Citing articles via CrossRef Citing articles via Scopus Citing articles via Web of Science Google Scholar Articles by Wang, S. Articles by Wang, M. Related Content Load related web page information Share Email this article CiteULike Delicious Facebook Google+ Mendeley Twitter What's this? Search this journal: Advanced » Current Issue December 2016 59 (12) Alert me to new issues The Journal About this journal Rights & Permissions Dispatch date of the next issue The Wilkes Award We are mobile – find out more Reviewer Guidelines Guidelines for Editors Review and Appeals Process Journals Career Network Published on behalf of BCS, The Chartered Institute for IT Impact factor: 1.000 5-Yr impact factor: 1.041 View full editorial board For Authors Instructions to authors Online submission instructions Submit a manuscript Self archiving policy 3hWaciBYRk30rSOQ7UOpP6viAxsZnEle true Looking for your next opportunity? Looking for jobs... Alerting Services Email table of contents Email Advance Access CiteTrack XML RSS feed Corporate Services Advertising sales Reprints Supplements var taxonomies = ("SCI01540"); Most Most Read A Simplex Method for Function Minimization What is the Use of Operating Systems? Data Compression for a Source with Markov Characteristics Overview of Parallel Architectures for Databases Permutations by Interchanges » View all Most Read articles Most Cited A Simplex Method for Function Minimization How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis A new approach to variable metric algorithms A Rapidly Convergent Descent Method for Minimization Function minimization by conjugate gradients » View all Most Cited articles Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department. Online ISSN 1460-2067 - Print ISSN 0010-4620 Copyright © 2016 British Computer Society Oxford Journals Oxford University Press Site Map Privacy Policy Cookie Policy Legal Notices Frequently Asked Questions Other Oxford University Press sites: Oxford University Press Oxford Journals China Oxford Journals Japan Academic & Professional books Children's & Schools Books Dictionaries & Reference Dictionary of National Biography Digital Reference English Language Teaching Higher Education Textbooks International Education Unit Law Medicine Music Online Products & Publishing Oxford Bibliographies Online Oxford Dictionaries Online Oxford English Dictionary Oxford Language Dictionaries Online Oxford Scholarship Online Reference Rights and Permissions Resources for Retailers & Wholesalers Resources for the Healthcare Industry Very Short Introductions World's Classics function fnc_onDomLoaded() { var query_context = getQueryContext(); PF_initOIUnderbar(query_context,":QS:default","","JRN"); PF_insertOIUnderbar(0); }; if (window.addEventListener) { window.addEventListener('load', fnc_onDomLoaded, false); } else if (window.attachEvent) { window.attachEvent('onload', fnc_onDomLoaded); } var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www."); document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E")); try { var pageTracker = _gat._getTracker("UA-189672-16"); pageTracker._setDomainName(".oxfordjournals.org"); pageTracker._trackPageview(); } catch(err) {}
TI - The 2-Extra Connectivity and 2-Extra Diagnosability of Bubble-Sort Star Graph Networks
JF - The Computer Journal
DO - 10.1093/comjnl/bxw037
DA - 2016-12-01
UR - https://www.deepdyve.com/lp/oxford-university-press/the-2-extra-connectivity-and-2-extra-diagnosability-of-bubble-sort-SBavXcOM1d
SP - 1839
VL - 59
IS - 12
DP - DeepDyve
ER -