On the public citation graph

The Complexity of Obtaining a Distance-Balanced Graph

0 signed · 38 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/978-3-540-68651-4_4openalex-snapshot
Theory and Algorithms
inferredcites →https://doi.org/10.1007/978-3-662-21708-5openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bfb0017162openalex-snapshot
On the computational complexity of codes in graphs
inferredcites →https://doi.org/10.1007/s00026-008-0337-2openalex-snapshot
Distance-Balanced Graphs
inferredcites →https://doi.org/10.1016/0095-8956(84)90050-9openalex-snapshot
Distance degree regular graphs
inferredcites →https://doi.org/10.1016/j.disc.2006.03.066openalex-snapshot
Distance-balanced graphs: Symmetry conditions
inferredcites →https://doi.org/10.1016/j.ejc.2008.09.018openalex-snapshot
Strongly distance-balanced graphs and graph products
inferredcites →https://doi.org/10.1016/j.ejc.2009.10.006openalex-snapshot
On distance-balanced graphs
inferredcites →https://doi.org/10.1016/j.ejc.2010.04.001openalex-snapshot
On a conjecture about the Szeged index
inferredcites →https://doi.org/10.1017/s0963548300002042openalex-snapshot
Paths, Stars and the Number Three
inferredcites →https://doi.org/10.1142/9789812796936_others05openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1201/9781420011326.ch8openalex-snapshot
Combinatorial Optimization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4612590openalex-extracted
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.1007/s00373-020-02247-9openalex-snapshot
On $$\ell $$-Distance-Balanced Product Graphs
inferred← citeshttps://doi.org/10.1007/s13226-023-00439-6openalex-snapshot
Pattern polynomial graphs
inferred← citeshttps://doi.org/10.1016/j.akcej.2018.09.002openalex-snapshot
Status connectivity indices and co-indices of graphs and its computation to some distance-balanced graphs
inferred← citeshttps://doi.org/10.1016/j.chemolab.2020.104059openalex-snapshot
Inverse sum indeg status index of graphs and its applications to octane isomers and benzenoid hydrocarbons
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.dam.2024.04.012openalex-snapshot
Proximity and remoteness in graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.001openalex-snapshot
Distance Laplacian spectra of graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2025.12.044openalex-snapshot
Distance signless Laplacian spectra of graphs: A survey
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.2012.06.004openalex-snapshot
The median Genocchi numbers, q -analogues and continued fractions
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.1016/j.laa.2013.02.030openalex-snapshot
Two Laplacians for the distance matrix of a graph
inferred← citeshttps://doi.org/10.1017/s000497271700096xopenalex-snapshot
ON SOME PROPERTIES OF QUASI-DISTANCE-BALANCED GRAPHS
inferred← citeshttps://doi.org/10.22108/toc.2016.15048openalex-snapshot
On the new extension of distance-balanced graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.1382.deeopenalex-snapshot
On 2-distance-balanced graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.2096.c9dopenalex-snapshot
Distance-balanced graphs and travelling salesman problems
inferred← citeshttps://doi.org/10.33044/revuma.2709openalex-snapshot
On certain regular nicely 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.37236/8071openalex-snapshot
Total Distance, Wiener Index and Opportunity Index in Wreath Products of Star Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1611.08270openalex-snapshot
Status connectivity indices and co-indices of graphs and its computation to intersection graph, hypercube, Kneser graph and achiral polyhex nanotorus
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.