On the public citation graph
A Note on the Distance-Balanced Property of Generalized Petersen Graphs
0 signed · 22 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.1016/j.disc.2006.03.066openalex-snapshot
Distance-balanced graphs: Symmetry conditions
inferredcites →https://doi.org/10.26493/1855-3974.75.895openalex-snapshot
The strongly distance-balanced property of the generalized Petersen graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1000/ijsmr.v1i3.38openalex-snapshot
Graph Theory in Distribution and Transportation Problems and the Connection to Distance-Balanced Graphs
inferred← citeshttps://doi.org/10.1007/s00026-023-00660-4openalex-snapshot
On Distance-Balanced Generalized Petersen Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.030openalex-snapshot
Quasi- λ -distance-balanced graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.011openalex-snapshot
ℓ -distance-balanced graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114579openalex-snapshot
On {1,2}-distance-balancedness of generalized Petersen graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.01.002openalex-snapshot
Equal opportunity networks, distance-balanced graphs, and Wiener game
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.12.002openalex-snapshot
Nicely distance-balanced graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103593openalex-snapshot
On some problems regarding distance-balanced graphs
inferred← citeshttps://doi.org/10.1017/s000497271700096xopenalex-snapshot
ON SOME PROPERTIES OF QUASI-DISTANCE-BALANCED GRAPHS
inferred← citeshttps://doi.org/10.1080/02522667.2020.1756044openalex-snapshot
Some points regarding the edge-distance-balanced property of the generalized Petersen graphs GP(n, 2)
inferred← citeshttps://doi.org/10.1080/02522667.2021.1939959openalex-snapshot
A further study on edge-distance-balanced property of the generalized Petersen graphs GP(6n+8, 3)
inferred← citeshttps://doi.org/10.1080/09720529.2019.1688968openalex-snapshot
A note on edge-distance-balanced property of the generalized Petersen graphsGP(4t, 2)
inferred← citeshttps://doi.org/10.1080/09720529.2021.1905746openalex-snapshot
A new achievement from reviewing some of the content about the edge-distance-balanced property of the generalized Petersen graphs GP(4i + 7, 2)
inferred← citeshttps://doi.org/10.1080/10586458.2011.564546openalex-snapshot
Combinatorial Properties of theK3 Surface: Simplicial Blowups and Slicings
inferred← citeshttps://doi.org/10.22108/toc.2016.15048openalex-snapshot
On the new extension of distance-balanced graphs
inferred← citeshttps://doi.org/10.33044/revuma.4824openalex-snapshot
The conjecture on distance-balancedness of generalized Petersen graphs holds when internal edges have jumps 3 or 4
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05257openalex-snapshot
$\ell$-distance-balanced 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.