The cyclic diagnosability of star grraphs *

The cyclic diagnosability of star grraphs * | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article The cyclic diagnosability of star grraphs * Yalan Li, Xiujuan Ma This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4672277/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 3 You are reading this latest preprint version Abstract Connectivity and diagnosability are two important parameters for the tolerance of an interconnection network. The cyclic diagnosability ct(G) is the maximum number of faulty vertices that the graph can be guaranted to identify under the condition that the remaining graph has at least two components contain a cycle. In this paper, we study the problem about the cyclic diagnosability ct(G) of star graphs and obtain probability analysis of its cyclic diagnosability. cyclic connectivity cyclic diagnosability PMC model MM* model. Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editor assigned by journal 02 Jul, 2024 Submission checks completed at journal 02 Jul, 2024 First submitted to journal 02 Jul, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4672277","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":325432331,"identity":"d83af40a-d4fa-4a2d-9fda-0f664876c565","order_by":0,"name":"Yalan Li","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA4klEQVRIie3PsWsCMRTH8d8ReOcQzBqh+DdEDsQ/J1ncCp3KDQcWLOdQqrP/heDi/uCmdL+hw3XprEtxKiqdXJqMgvkODwLvAy9AKnWD9cV5dMCQhDp0tqzChC7EAoXKUZjONxEEf8StVxgPvl5FBMnlaG+rz2zDmJbuhaAWbzZwmCy0bb6FYTSt2z1A+49NiBhticlwVrfOE4x+DJLiaH9ZGhb05GoRRcba1awHcyJEEnqeuCUbJaTQ1jcy+BeleNvuf3hWK58djmU1VIv3/wnQM1dPGVi/lHcRS6lUKnXXnQDMLEKcD/Cx7AAAAABJRU5ErkJggg==","orcid":"","institution":"Qinghai Normal University","correspondingAuthor":true,"prefix":"","firstName":"Yalan","middleName":"","lastName":"Li","suffix":""},{"id":325432332,"identity":"3aee771a-7583-4895-a35d-47270a147b6c","order_by":1,"name":"Xiujuan Ma","email":"","orcid":"","institution":"Qinghai Normal University","correspondingAuthor":false,"prefix":"","firstName":"Xiujuan","middleName":"","lastName":"Ma","suffix":""}],"badges":[],"createdAt":"2024-07-02 07:34:54","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4672277/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4672277/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":61062887,"identity":"17ed49b2-91ab-4afd-9a0d-9e10b474d0d8","added_by":"auto","created_at":"2024-07-25 06:59:08","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":389857,"visible":true,"origin":"","legend":"","description":"","filename":"TheCyclicDiagnosabilityOfStarGraph.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4672277/v1_covered_9c2a2377-2762-432d-ae97-36a7902beb8d.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"The cyclic diagnosability of star grraphs *","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"cyclic connectivity, cyclic diagnosability, PMC model, MM* model.","lastPublishedDoi":"10.21203/rs.3.rs-4672277/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4672277/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Connectivity and diagnosability are two important parameters for the tolerance of an interconnection network. The cyclic diagnosability ct(G) is the maximum number of faulty vertices that the graph can be guaranted to identify under the condition that the remaining graph has at least two components contain a cycle. In this paper, we study the problem about the cyclic diagnosability ct(G) of star graphs and obtain probability analysis of its cyclic diagnosability.","manuscriptTitle":"The cyclic diagnosability of star grraphs *","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-07-25 06:51:02","doi":"10.21203/rs.3.rs-4672277/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorAssigned","content":"","date":"2024-07-03T01:51:37+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-07-03T01:51:31+00:00","index":"","fulltext":""},{"type":"submitted","content":"The Journal of Supercomputing","date":"2024-07-02T07:32:45+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"ddeda98b-e2e8-4f8b-bf4f-b61099a27be5","owner":[],"postedDate":"July 25th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2024-07-25T06:51:02+00:00","versionOfRecord":[],"versionCreatedAt":"2024-07-25 06:51:02","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4672277","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4672277","identity":"rs-4672277","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}