On the public citation graph

On Spanning Wide Diameter of Graphs

0 signed · 14 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(199601)27:1<19::aid-net2>3.0.co;2-hopenalex-extracted
Node fault tolerance in graphs
inferredcites →https://doi.org/10.1002/net.20135openalex-extracted
On the spanningw‐wide diameter of the star graph
inferredcites →https://doi.org/10.1002/net.3230230207openalex-extracted
Edge fault tolerance in graphs
inferredcites →https://doi.org/10.1002/net.3230240305openalex-extracted
Mengerian properties, hamiltonicity, and claw‐free graphs
inferredcites →https://doi.org/10.1007/s10878-007-9047-7openalex-extracted
On the equitable k *-laceability of hypercubes
inferredcites →https://doi.org/10.1016/0012-365x(94)90036-1openalex-extracted
On the k-diameter of k-regular k-connected graphs
inferredcites →https://doi.org/10.1016/j.dam.2016.10.010openalex-extracted
The wide-diameter of Zn,k
inferredcites →https://doi.org/10.1016/j.dam.2017.09.007openalex-extracted
The fault-diameter and wide-diameter of twisted hypercubes
inferredcites →https://doi.org/10.1016/j.disc.2004.08.005openalex-extracted
Disjoint cycles and spanning graphs of hypercubes
inferredcites →https://doi.org/10.1016/j.disc.2006.06.021openalex-extracted
On the spanning connectivity of graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.03.015openalex-extracted
Globally bi- 3∗ -connected graphs
inferredcites →https://doi.org/10.1016/j.disc.2017.11.005openalex-extracted
On the spanning connectivity of the generalized Petersen graphs P(n,3)
inferredcites →https://doi.org/10.1016/j.ipl.2004.06.006openalex-extracted
The super laceability of the hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2017.07.005openalex-extracted
The vulnerability of the diameter of the enhanced hypercubes
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.