On the public citation graph

On the Spanning Trees of the Hypercube and other Products of Graphs

https://doi.org/10.37236/2510
0 signed · 19 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.1016/0012-365x(85)90192-xopenalex-snapshot
A combinatorial approach to matrix algebra
inferredcites →https://doi.org/10.1016/j.dam.2007.07.014openalex-snapshot
On encodings of spanning trees
inferredcites →https://doi.org/10.1016/j.jcta.2003.08.003openalex-snapshot
Factorizations of some weighted spanning tree enumerators
inferredcites →https://doi.org/10.1017/cbo9780511609589openalex-snapshot
Enumerative Combinatorics
inferredcites →https://doi.org/10.21136/cmj.1973.101168openalex-snapshot
Algebraic connectivity of graphs
inferredcites →https://doi.org/10.48550/arxiv.1109.6393openalex-snapshot
Counting the spanning trees of the 3-cube using edge slides

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4614-6998-8_9openalex-snapshot
The Matrix-Tree Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_28openalex-snapshot
Simplicial and cellular trees
inferred← citeshttps://doi.org/10.1007/978-3-319-77173-1_9openalex-snapshot
The Matrix-Tree Theorem
inferred← citeshttps://doi.org/10.1007/s00373-023-02746-5openalex-snapshot
A Novel Count of the Spanning Trees of a Cube
inferred← citeshttps://doi.org/10.1073/pnas.2318329121openalex-snapshot
The Hill function is the universal Hopfield barrier for sharpness of input–output responses
inferred← citeshttps://doi.org/10.1098/rsfs.2022.0013openalex-snapshot
The linear framework: using graph theory to reveal the algebra and thermodynamics of biomolecular systems
inferred← citeshttps://doi.org/10.1109/tr.2017.2738659openalex-snapshot
Reliability Analysis of Ethernet Ring Mesh Networks
inferred← citeshttps://doi.org/10.37236/3557openalex-snapshot
The Goldman-Rota Identity and the Grassmann Scheme
inferred← citeshttps://doi.org/10.37236/5819openalex-snapshot
Directed Rooted Forests in Higher Dimension
inferred← citeshttps://doi.org/10.47443/dml.2024.004openalex-snapshot
The number of spanning trees in a superprism
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6244openalex-snapshot
The Goldman-Rota identity and the Grassmann scheme
inferred← citeshttps://doi.org/10.48550/arxiv.1807.11183openalex-snapshot
Characterisation and classification of signatures of spanning trees of the $n$-cube
inferred← citeshttps://doi.org/10.5802/afst.1532openalex-snapshot
Laplacian matrices and spanning trees of tree 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.