On the public citation graph

Vertex Transitivity and Super Line Connectedness

https://doi.org/10.1137/0403044
0 signed · 16 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/jgt.3190130603openalex-snapshot
Maximally connected digraphs
inferredcites →https://doi.org/10.1007/bf01433466openalex-snapshot
Minimalen-fach kantenzusammenh�ngende Graphen
inferredcites →https://doi.org/10.1016/0095-8956(81)90085-xopenalex-snapshot
Quelques problèmes de connexité dans les graphes orientés
inferredcites →https://doi.org/10.1016/0898-1221(87)90049-6openalex-snapshot
Reliability properties of the hypercube network
inferredcites →https://doi.org/10.1137/0607011openalex-snapshot
Super Line-Connectivity Properties of Circulant Graphs

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.3230240405openalex-snapshot
On super i‐connected graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_2openalex-snapshot
Connectivity of Cayley Digraphs
inferred← citeshttps://doi.org/10.1016/j.amc.2017.08.006openalex-snapshot
Connectivity of half vertex transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129698openalex-snapshot
Super edge-connectivity of transitive hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.018openalex-snapshot
Super-connected arc-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.06.035openalex-snapshot
Maximally edge-connected and vertex-connected graphs and digraphs: A survey
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.05.005openalex-snapshot
Yahya Ould Hamidoune’s mathematical journey: A critical review of his work
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00341-3openalex-snapshot
A survey on multi-loop networks
inferred← citeshttps://doi.org/10.1137/s089548019630635xopenalex-snapshot
On Isoperimetric Connectivity in Vertex-Transitive Graphs
inferred← citeshttps://doi.org/10.1142/s0219265921420238openalex-snapshot
The Arc-Connectivity of 3-Regular Digraphs with Two Orbits
inferred← citeshttps://doi.org/10.48550/arxiv.1402.4627openalex-snapshot
Maximally connected and super arc-connected Bi-Cayley digraphs
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.