On the public citation graph

On diameter stability of graphs

https://doi.org/10.1007/bfb0070382
0 signed · 17 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.1007/bf01894681openalex-snapshot
On some extremal graphs
inferredcites →https://doi.org/10.1080/0025570x.1968.11975860openalex-snapshot
On Critical Graphs of Diameter 2
inferredcites →https://doi.org/10.1080/0025570x.1975.11976513openalex-snapshot
An Extremal Problem of Graphs with Diameter 2
inferredcites →https://doi.org/10.1109/tcs.1977.1084370openalex-snapshot
Geodetic connectivity of graphs
inferredcites →https://doi.org/10.1307/mmj/1028999370openalex-snapshot
On the diameter of a graph.
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

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.3230110106openalex-snapshot
Graphs as models of communication network vulnerability: Connectivity and persistence
inferred← citeshttps://doi.org/10.1002/net.3230120405openalex-snapshot
On a measure of communication network vulnerability
inferred← citeshttps://doi.org/10.1007/bf01788663openalex-snapshot
Large fault-tolerant interconnection networks
inferred← citeshttps://doi.org/10.1007/s11741-003-0008-9openalex-snapshot
Vulnerability in graphs of diameter five
inferred← citeshttps://doi.org/10.1007/s11741-005-0041-yopenalex-snapshot
A note on vulnerability in graphs of diameter five(II)
inferred← citeshttps://doi.org/10.1007/s11741-010-0215-1openalex-snapshot
On 3-diameter-stable graphs of diameter 4
inferred← citeshttps://doi.org/10.1007/s11741-010-0623-3openalex-snapshot
Results on diameter-stable graphs related to girth
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90062-6openalex-snapshot
Counterexamples to theorems of Menger type for the diameter
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90126-mopenalex-snapshot
A necessary and sufficient condition for a graph G with diameter 5 to be 2-diameter-stable
inferred← citeshttps://doi.org/10.1016/0895-7177(93)90254-vopenalex-snapshot
Vulnerability in graphs of diameter four
inferred← citeshttps://doi.org/10.1016/j.mcm.2010.05.027openalex-snapshot
Some extended results on diameter-stable 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.