On the public citation graph

Linearly many faults in 2‐tree‐generated networks

https://doi.org/10.1002/net.20319

0 signed · 70 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-0037(199708)30:1<73::aid-net8>3.0.co;2-iopenalex-snapshot

Introduction to graph theory

inferredcites →https://doi.org/10.1002/net.10045openalex-snapshot

Increasing the connectivity of the star graphs

inferredcites →https://doi.org/10.1002/net.3230230414openalex-snapshot

A new class of interconnection networks based on the alternating group

inferredcites →https://doi.org/10.1016/0020-0190(92)90030-yopenalex-snapshot

Arrangement graphs: a class of generalized star graphs

inferredcites →https://doi.org/10.1016/0020-0190(95)00162-1openalex-snapshot

The (n, k)-star graph: A generalized star graph

inferredcites →https://doi.org/10.1016/j.amc.2006.11.085openalex-snapshot

Restricted connectivity for three families of interconnection networks

inferredcites →https://doi.org/10.1016/j.disc.2004.11.004openalex-snapshot

Cuts leaving components of given minimum order

inferredcites →https://doi.org/10.1016/j.ins.2007.05.034openalex-snapshot

Linearly many faults in Cayley graphs generated by transposition trees

inferredcites →https://doi.org/10.1016/j.mcm.2007.11.007openalex-snapshot

Hamiltonian connectivity of 2-tree-generated networks

inferredcites →https://doi.org/10.1016/s0021-9800(69)80120-1openalex-snapshot

The number of labeled k-dimensional trees

inferredcites →https://doi.org/10.1016/s0096-3003(02)00223-0openalex-snapshot

Super-connectivity and super-edge-connectivity for some interconnection networks

inferredcites →https://doi.org/10.1080/00207160410001661726openalex-snapshot

On the maximal connected component of hypercube with faulty vertices

inferredcites →https://doi.org/10.1080/00207160500113173openalex-snapshot

On the maximal connected component of a hypercube with faulty vertices III

inferredcites →https://doi.org/10.1112/s0025579300008500openalex-snapshot

Properties and characterizations of k ‐trees

inferredcites →https://doi.org/10.1142/s0129054107005108openalex-snapshot

FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.21476openalex-snapshot

Linearly many faults in arrangement graphs

inferred← citeshttps://doi.org/10.1007/s11227-017-1964-3openalex-snapshot

On the restricted connectivity of the arrangement graph

inferred← citeshttps://doi.org/10.1007/s12190-025-02445-9openalex-snapshot

Non-inclusive g-extra diagnosability of regular networks under the MM* model

inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.040openalex-snapshot

Matching preclusion and conditional matching preclusion for regular interconnection networks

inferred← citeshttps://doi.org/10.1016/j.dam.2026.01.018openalex-snapshot

Fault tolerability of Cayley graphs generated by transposition unicyclic graphs with a triangle

inferred← citeshttps://doi.org/10.1016/j.ins.2011.05.010openalex-snapshot

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees

inferred← citeshttps://doi.org/10.1016/j.ins.2013.04.038openalex-snapshot

Fault diagnosability of arrangement graphs

inferred← citeshttps://doi.org/10.1016/j.ipl.2010.08.010openalex-snapshot

A kind of conditional fault tolerance of alternating group graphs

inferred← citeshttps://doi.org/10.1016/j.ipl.2011.07.017openalex-snapshot

Conditional fault tolerance of arrangement graphs

inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105068openalex-snapshot

The (t,k)-diagnosability of Cayley graph generated by 2-tree

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.009openalex-snapshot

Linearly many faults in dual-cube-like networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.09.008openalex-snapshot

On the conditional diagnosability of matching composition networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.046openalex-snapshot

Conditional diagnosability and strong diagnosability of Split-Star Networks under the PMC model

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.036openalex-snapshot

Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.034openalex-snapshot

Extra diagnosability and good-neighbor diagnosability of n-dimensional alternating group graph AG under the PMC model

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.04.015openalex-snapshot

Restricted connectivity and good-neighbor diagnosability of split-star networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.042openalex-snapshot

Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.029openalex-snapshot

Reliability analysis of the cactus-based networks

inferred← citeshttps://doi.org/10.1080/00207160.2011.638978openalex-snapshot

Component connectivity of the hypercubes

inferred← citeshttps://doi.org/10.1080/00207160.2012.710325openalex-snapshot

Conditional fault diagnosis of hierarchical hypercubes

inferred← citeshttps://doi.org/10.1080/00207160.2015.1091070openalex-snapshot

On the extraconnectivity ofk-aryn-cube networks

inferred← citeshttps://doi.org/10.1080/00207160.2016.1148813openalex-snapshot

On extra connectivity and extra edge-connectivity of balanced hypercubes

inferred← citeshttps://doi.org/10.1080/09728600.2013.12088723openalex-snapshot

Fault tolerance of augmented cubes

inferred← citeshttps://doi.org/10.1080/17445760.2012.704631openalex-snapshot

On conditional fault tolerant of dual-cubes

inferred← citeshttps://doi.org/10.1080/17445760.2012.735234openalex-snapshot

Linearly many faults in augmented cubes

inferred← citeshttps://doi.org/10.1093/comjnl/bxaa070openalex-snapshot

Reliability Analysis of Alternating Group Graphs and Split-Stars

inferred← citeshttps://doi.org/10.1093/comjnl/bxac006openalex-snapshot

Component Fault Diagnosis and Fault Tolerance of Alternating Group Graphs

inferred← citeshttps://doi.org/10.1093/comjnl/bxaf085openalex-snapshot

Cyclic connectivity and cyclic diagnosability of alternating group graphs

inferred← citeshttps://doi.org/10.1093/comjnl/bxx089openalex-snapshot

The 3-extra Connectivity and Faulty Diagnosability

inferred← citeshttps://doi.org/10.1093/comjnl/bxx100openalex-snapshot

A Kind of Conditional Connectivity of Cayley Graphs Generated by 2-trees

inferred← citeshttps://doi.org/10.1093/comjnl/bxz077openalex-snapshot

A Kind Of Conditional Vertex Connectivity Of Cayley Graphs Generated By Wheel Graphs

inferred← citeshttps://doi.org/10.1109/access.2019.2896101openalex-snapshot

Minimum Neighborhood of Alternating Group Graphs

inferred← citeshttps://doi.org/10.1109/access.2019.2929238openalex-snapshot

Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity

inferred← citeshttps://doi.org/10.1109/access.2019.2946705openalex-snapshot

Component Reliability Evaluation on Split-Stars

inferred← citeshttps://doi.org/10.1109/cse.2014.235openalex-snapshot

Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults

inferred← citeshttps://doi.org/10.1109/i-span.2012.15openalex-snapshot

On the Conditional Diagnosability of Cayley Graphs Generated by 2-trees and Related Networks

inferred← citeshttps://doi.org/10.1109/pic.2018.8706296openalex-snapshot

Structure Connectivity and Substructure Connectivity of Alternating Group Graphs

inferred← citeshttps://doi.org/10.1109/tc.2012.15openalex-snapshot

Conditional Diagnosability of Alternating Group Graphs

inferred← citeshttps://doi.org/10.1109/tc.2013.128openalex-snapshot

Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity

inferred← citeshttps://doi.org/10.1109/tc.2015.2512866openalex-snapshot

The -Diagnosability for Regular Networks

inferred← citeshttps://doi.org/10.1109/tpds.2014.2347961openalex-snapshot

The Extra Connectivity and Conditional Diagnosability of Alternating Group Networks

inferred← citeshttps://doi.org/10.1109/tpds.2015.2400459openalex-snapshot

The Extra, Restricted Connectivity and Conditional Diagnosability of Split-Star Networks

inferred← citeshttps://doi.org/10.1109/tr.2021.3066185openalex-snapshot

An Analysis on the Reliability of the Alternating Group Graph

inferred← citeshttps://doi.org/10.1142/s0129054111008994openalex-snapshot

LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS

inferred← citeshttps://doi.org/10.1142/s0129054112500256openalex-snapshot

CONDITIONAL FAULT DIAGNOSABILITY OF DUAL-CUBES

inferred← citeshttps://doi.org/10.1142/s0129054115500094openalex-snapshot

Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks

inferred← citeshttps://doi.org/10.1142/s012905411850017xopenalex-snapshot

Component Edge Connectivity of Hypercubes

inferred← citeshttps://doi.org/10.1142/s0129626416500055openalex-snapshot

On the Conditional Diagnosability of Hyper-Buttery Graphs and Related Networks

inferred← citeshttps://doi.org/10.1142/s0219265911003003openalex-snapshot

STRONG MATCHING PRECLUSION FOR THE ALTERNATING GROUP GRAPHS AND SPLIT-STARS

inferred← citeshttps://doi.org/10.1142/s0219265912500077openalex-snapshot

A UNIFIED APPROACH TO THE CONDITIONAL DIAGNOSABILITY OF INTERCONNECTION NETWORKS

inferred← citeshttps://doi.org/10.1142/s0219265915500073openalex-snapshot

Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults

inferred← citeshttps://doi.org/10.1142/s0219265921420172openalex-snapshot

A Note on Linearly Many Faults of Interconnection Networks

inferred← citeshttps://doi.org/10.1142/s0219265921500158openalex-snapshot

Connectivity Properties of Generalized K4-Hypercubes

inferred← citeshttps://doi.org/10.1515/zna-2025-0033openalex-snapshot

Extremal linear triangular chains with respect to the Kirchhoff index

inferred← citeshttps://doi.org/10.3390/math12020268openalex-snapshot

A Validation of the Phenomenon of Linearly Many Faults on Burnt Pancake Graphs with Its Applications

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.