On the public citation graph
Increasing the connectivity of the star graphs
0 signed · 75 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.
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.
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(199905)33:3<221::aid-net8>3.0.co;2-kopenalex-snapshot
Congestion-free, dilation-2 embedding of complete binary trees into star graphs
inferredcites →https://doi.org/10.1002/(sici)1097-0037(200001)35:1<83::aid-net7>3.0.co;2-dopenalex-snapshot
Cluster fault-tolerant routing in star graphs
inferredcites →https://doi.org/10.1007/978-1-4419-8698-6openalex-snapshot
Theory and Application of Graphs
inferredcites →https://doi.org/10.1007/s101070050031openalex-snapshot
Connectivity augmentation of networks: structures and algorithms
inferredcites →https://doi.org/10.1007/s101070050041openalex-snapshot
Successive edge-connectivity augmentation problems
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(93)90013-yopenalex-snapshot
Unidirectional star graphs
inferredcites →https://doi.org/10.1016/0020-0190(93)90043-9openalex-snapshot
Fault tolerant routing in the star and pancake interconnection networks
inferredcites →https://doi.org/10.1016/0020-0190(93)90119-topenalex-snapshot
The 4-star graph is not a subgraph of any hypercube
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/0167-9260(94)90021-3openalex-snapshot
On VLSI layouts of the star graph and related networks
inferredcites →https://doi.org/10.1016/0967-0661(93)90237-lopenalex-snapshot
Introduction to parallel computing
inferredcites →https://doi.org/10.1016/s0020-0190(98)00121-5openalex-snapshot
An efficient algorithm for k-pairwise disjoint paths in star graphs
inferredcites →https://doi.org/10.1016/s0020-0190(98)00133-1openalex-snapshot
VLSI layouts of complete graphs and star graphs
inferredcites →https://doi.org/10.1016/s0020-0190(99)00155-6openalex-snapshot
On the Day–Tripathi orientation of the star graphs: Connectivity
inferredcites →https://doi.org/10.1016/s0166-218x(01)00234-7openalex-snapshot
Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness
inferredcites →https://doi.org/10.1016/s0927-0507(05)80127-6openalex-snapshot
Chapter 10 Design of survivable networks
inferredcites →https://doi.org/10.1109/12.589231openalex-snapshot
Toward optimal broadcast in a star graph using multiple spanning trees
inferredcites →https://doi.org/10.1109/71.149958openalex-snapshot
Optimal broadcasting on the star graph
inferredcites →https://doi.org/10.1109/71.262586openalex-snapshot
A comparative study of topological properties of hypercubes and star graphs
inferredcites →https://doi.org/10.1109/71.382321openalex-snapshot
A well-behaved enumeration of star graphs
inferredcites →https://doi.org/10.1109/71.388046openalex-snapshot
An optimal broadcasting algorithm without message redundancy in star graphs
inferredcites →https://doi.org/10.1109/71.508251openalex-snapshot
Balanced spanning trees in complete and incomplete star graphs
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.1137/s0097539798347189openalex-snapshot
How to Make a Square Grid Framework with Cables Rigid
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.20319openalex-snapshot
Linearly many faults in 2‐tree‐generated networks
inferred← citeshttps://doi.org/10.1002/net.20441openalex-snapshot
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper‐stars
inferred← citeshttps://doi.org/10.1002/net.21476openalex-snapshot
Linearly many faults in arrangement graphs
inferred← citeshttps://doi.org/10.1002/net.21539openalex-snapshot
Generalized measures for fault tolerance of star networks
inferred← citeshttps://doi.org/10.1007/978-3-030-90199-8_27openalex-snapshot
The 3-Set Tree Connectivity of the Folded Petersen Cube Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_18openalex-snapshot
Cyclic Vertex Connectivity of Star Graphs
inferred← citeshttps://doi.org/10.1007/s00373-016-1741-8openalex-snapshot
On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs
inferred← citeshttps://doi.org/10.1007/s11227-025-07128-7openalex-snapshot
An analysis on component reliability of (n, k)-star networks
inferred← citeshttps://doi.org/10.1007/s11227-025-07272-0openalex-snapshot
A novel fault-tolerant technique for star graph-based interconnection networks
inferred← citeshttps://doi.org/10.1007/s12190-024-02270-6openalex-snapshot
Vulnerability assessment of a new class of Cayley graph
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129644openalex-snapshot
Conditional (edge) neighbor connectivity of hierarchical star networks
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.003openalex-snapshot
The generalized 4-connectivity of hypercubes
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.017openalex-snapshot
A new approach to finding the extra connectivity of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.07.013openalex-snapshot
The 1-good neighbor connectivity of unidirectional star graph networks
inferred← citeshttps://doi.org/10.1016/j.dam.2022.08.029openalex-snapshot
Characterization of component diagnosability of regular networks
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.012openalex-snapshot
{1,2,3}-extra connectivity of Cayley graphs generated by k-trees
inferred← citeshttps://doi.org/10.1016/j.ins.2007.05.034openalex-snapshot
Linearly many faults in Cayley graphs generated by transposition 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.ins.2014.02.081openalex-snapshot
On reliability of the folded hypercubes in terms of the extra edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.03.010openalex-snapshot
Conditional diagnosability of alternating group networks
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.2023.104818openalex-snapshot
Characterization of matroidal connectivity of regular networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.006openalex-snapshot
Relationship between extra edge connectivity and component edge connectivity for regular graphs
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.2022.05.028openalex-snapshot
Note on reliability of star graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115659openalex-snapshot
The non-inclusive diagnosability of a kind of networks
inferred← citeshttps://doi.org/10.1080/00207160.2012.710325openalex-snapshot
Conditional fault diagnosis of hierarchical hypercubes
inferred← citeshttps://doi.org/10.1080/23799927.2018.1467488openalex-snapshot
Fault-tolerance and diagnosability of hierarchical star networks
inferred← citeshttps://doi.org/10.1108/09696470510611393openalex-snapshot
Western and Eastern views on social networks
inferred← citeshttps://doi.org/10.1109/bmei.2009.5305876openalex-snapshot
The Study of Fault Tolerance on Alternating Group Networks
inferred← citeshttps://doi.org/10.1109/eiis.2017.8298665openalex-snapshot
The h-extra connectivity of the star graph Networks
inferred← citeshttps://doi.org/10.1109/iccse.2010.5593645openalex-snapshot
Fault tolerance of (n, k)-Star Graphs
inferred← citeshttps://doi.org/10.1109/ispdc.2016.71openalex-snapshot
Reliability Evaluation of Star Graphs in Terms of Extra Edge Connectivity
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.2013.228openalex-snapshot
The $t/k$-Diagnosability of Star Graph Networks
inferred← citeshttps://doi.org/10.1109/tr.2014.2354912openalex-snapshot
Conditional Diagnosability of $(n,k)$ -Star Networks Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1109/tr.2020.3013158openalex-snapshot
Strong Reliability of Star Graphs Interconnection Networks
inferred← citeshttps://doi.org/10.1142/s0129054107005108openalex-snapshot
FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
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/s0129054120500100openalex-snapshot
On Component Connectivity of Hierarchical Star Networks
inferred← citeshttps://doi.org/10.1142/s0129054122500277openalex-snapshot
Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern
inferred← citeshttps://doi.org/10.1142/s0219265917410018openalex-snapshot
The 1-Good-Neighbor Conditional Diagnosability of Some Regular Graphs
inferred← citeshttps://doi.org/10.1142/s1793830911001322openalex-snapshot
CYCLIC CONNECTIVITY OF STAR GRAPH
inferred← citeshttps://doi.org/10.12785/msl/010206openalex-snapshot
Generalized Measures of Edge Fault Tolerance in (n,k)-star Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1204.1440openalex-snapshot
Generalized Measures of Fault Tolerance in (n,k)-star Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.6475openalex-snapshot
Generalized Connectivity of Star Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1607.07761openalex-snapshot
From Graph Isoperimetric Inequality to Network Connectivity -- A New Approach
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.