On the public citation graph

The non-negative spectrum of a digraph

https://doi.org/10.1515/math-2020-0005
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.1002/jgt.22057openalex-snapshot
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs
inferredcites →https://doi.org/10.1007/978-1-4614-1939-6openalex-snapshot
Spectra of Graphs
inferredcites →https://doi.org/10.1016/j.laa.2007.06.017openalex-snapshot
On the null-spaces of acyclic and unicyclic singular graphs
inferredcites →https://doi.org/10.1016/j.laa.2009.02.033openalex-snapshot
Spectra of digraphs
inferredcites →https://doi.org/10.1016/j.laa.2018.03.019openalex-snapshot
A {−1,0,1}- and sparsest basis for the null space of a forest in optimal time
inferredcites →https://doi.org/10.2298/petf0213042bopenalex-snapshot
A survey on integral graphs
inferredcites →https://doi.org/10.2298/petf0314037bopenalex-snapshot
The eigenspace of the eigenvalue -2 in generalized line graphs and a problem in security of statistical databases
inferredcites →https://doi.org/10.2298/petf0718059hopenalex-snapshot
There are integral trees of diameter 7
inferredcites →https://doi.org/10.26493/1855-3974.1021.c0aopenalex-snapshot
On ±1 eigenvectors of graphs
inferredcites →https://doi.org/10.26493/1855-3974.682.065openalex-snapshot
Non-negative spectrum of a digraph
inferredcites →https://doi.org/10.37236/876openalex-snapshot
Small Integral Trees

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.4100543openalex-extracted
Inverse of α−Hermitian Adjacency Matrix of Mixed Tree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-52969-6_25openalex-snapshot
Inverse of Hermitian Adjacency Matrix of Mixed Bipartite Graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2024.01.016openalex-snapshot
Geometric and spectral analysis on weighted digraphs
inferred← citeshttps://doi.org/10.1098/rsos.260035openalex-snapshot
Using matrix analysis to understand competition in food webs and antimicrobial resistance networks
inferred← citeshttps://doi.org/10.1515/math-2020-0167openalex-snapshot
On the N-spectrum of oriented graphs
inferred← citeshttps://doi.org/10.29020/nybg.ejpam.v15i3.4422openalex-snapshot
On the Cospectrality of Hermitian Adjacency Matrices of Mixed 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.