On the public citation graph

On the spanningw‐wide diameter of the star graph

0 signed · 34 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/1097-0037(200012)36:4<225::aid-net3>3.0.co;2-gopenalex-snapshot
Hamiltonian-laceability of star graphs
inferredcites →https://doi.org/10.1006/jpdc.1995.1006openalex-snapshot
Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions
inferredcites →https://doi.org/10.1006/jpdc.1996.0028openalex-snapshot
Conditional Fault Diameter of Star Graph Networks
inferredcites →https://doi.org/10.1007/s002240000089openalex-snapshot
Embedding Complete Binary Trees into Star and Pancake Graphs
inferredcites →https://doi.org/10.1016/0020-0190(93)90060-mopenalex-snapshot
On the fault-diameter of the star graph
inferredcites →https://doi.org/10.1016/0020-0190(95)00135-yopenalex-snapshot
Node-to-node cluster fault tolerant routing in star graphs
inferredcites →https://doi.org/10.1016/j.ins.2003.09.023openalex-snapshot
Hyper hamiltonian laceability on edge fault star graph
inferredcites →https://doi.org/10.1016/j.ipl.2004.05.013openalex-snapshot
The super-connected property of recursive circulant graphs
inferredcites →https://doi.org/10.1016/j.ipl.2004.06.006openalex-snapshot
The super laceability of the hypercubes
inferredcites →https://doi.org/10.1016/j.jpdc.2004.08.004openalex-snapshot
Longest paths and cycles in faulty star graphs
inferredcites →https://doi.org/10.1016/j.tcs.2005.01.018openalex-snapshot
Embedding longest fault-free paths onto star graphs with more vertex faults
inferredcites →https://doi.org/10.1016/j.tcs.2005.02.007openalex-snapshot
The super connectivity of the pancake graphs and the super laceability of the star graphs
inferredcites →https://doi.org/10.1016/s0304-3975(00)00190-0openalex-snapshot
Longest fault-free paths in star graphs with vertex faults
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.250605openalex-snapshot
Near embeddings of hypercubes into Cayley graphs on the symmetric group
inferredcites →https://doi.org/10.1109/12.485370openalex-snapshot
Edge-disjoint spanning trees on the star network with applications to fault tolerance
inferredcites →https://doi.org/10.1109/12.494105openalex-snapshot
Embedding an arbitrary binary tree into the star graph
inferredcites →https://doi.org/10.1109/12.954510openalex-snapshot
Longest fault-free paths in star graphs with edge faults
inferredcites →https://doi.org/10.1109/ispan.2004.1300536openalex-snapshot
The spanning diameter of the star graphs
inferredcites →https://doi.org/10.1142/s0218126691000215openalex-snapshot
EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS
inferredcites →https://doi.org/10.2307/3008805openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.4064/fm-10-1-96-115openalex-snapshot
Zur allgemeinen Kurventheorie

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4476387openalex-extracted
On Spanning Wide Diameter of Graphs
inferred← citeshttps://doi.org/10.1002/net.21456openalex-snapshot
Property Pd,m and efficient design of reliable networks
inferred← citeshttps://doi.org/10.1016/j.amc.2007.08.073openalex-snapshot
Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.014openalex-snapshot
On the spanning fan-connectivity of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.12.024openalex-snapshot
On the spanning connectivity of tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.023openalex-snapshot
Mutually independent hamiltonian cycles for the pancake graphs and the star graphs
inferred← citeshttps://doi.org/10.1080/00207161003786614openalex-snapshot
Fault-free mutually independent Hamiltonian cycles of faulty star graphs
inferred← citeshttps://doi.org/10.1109/i-span.2008.41openalex-snapshot
Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs
inferred← citeshttps://doi.org/10.1142/s0129626424500063openalex-snapshot
On Spanning Wide Diameter of Spider Web Networks
inferred← citeshttps://doi.org/10.1142/s0219265908002175openalex-snapshot
CONDITIONAL DIAGNOSABILITY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITION TREES UNDER THE COMPARISON DIAGNOSIS MODEL
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.389openalex-snapshot
The Spanning Connectivity of the Burnt Pancake Graphs
inferred← citeshttps://doi.org/10.70675/53af4afcz56aaz4876zb235z21f7f302f893openalex-snapshot
Some vertex colouring problems and a generalisation of Hamilton-connectivity in graphs
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.