On the public citation graph
https://doi.org/10.2139/ssrn.4612590
0 signed · 20 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.1007/s00026-023-00660-4openalex-extracted
On Distance-Balanced Generalized Petersen Graphs
inferredcites →https://doi.org/10.1016/j.amc.2021.126245openalex-extracted
Mostar index: Results and perspectives
inferredcites →https://doi.org/10.1016/j.dam.2017.07.010openalex-extracted
On the Wiener index, distance cospectrality and transmission-regular graphs
inferredcites →https://doi.org/10.1016/j.dam.2018.03.011openalex-extracted
ℓ -distance-balanced graphs
inferredcites →https://doi.org/10.1016/j.disc.2006.03.066openalex-extracted
Distance-balanced graphs: Symmetry conditions
inferredcites →https://doi.org/10.1016/j.disopt.2014.01.002openalex-extracted
Equal opportunity networks, distance-balanced graphs, and Wiener game
inferredcites →https://doi.org/10.1016/j.ejc.2008.09.018openalex-extracted
Strongly distance-balanced graphs and graph products
inferredcites →https://doi.org/10.1016/j.ejc.2009.10.006openalex-extracted
On distance-balanced graphs
inferredcites →https://doi.org/10.1016/j.ejc.2011.10.002openalex-extracted
On the connectivity of bipartite distance-balanced graphs
inferredcites →https://doi.org/10.1016/j.ejc.2013.12.002openalex-extracted
Nicely distance-balanced graphs
inferredcites →https://doi.org/10.1016/j.ejc.2022.103593openalex-extracted
On some problems regarding distance-balanced graphs
inferredcites →https://doi.org/10.26493/1855-3974.1382.deeopenalex-extracted
On 2-distance-balanced graphs
inferredcites →https://doi.org/10.26493/1855-3974.2096.c9dopenalex-extracted
Distance-balanced graphs and travelling salesman problems
inferredcites →https://doi.org/10.26493/1855-3974.75.895openalex-extracted
The strongly distance-balanced property of the generalized Petersen graphs
inferredcites →https://doi.org/10.33044/revuma.2709openalex-extracted
On certain regular nicely distance-balanced graphs
inferredcites →https://doi.org/10.37236/271openalex-extracted
A Note on the Distance-Balanced Property of Generalized Petersen Graphs
inferredcites →https://doi.org/10.37236/536openalex-extracted
The Complexity of Obtaining a Distance-Balanced Graph
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.