On the public citation graph
Multiplicity of Any Eigenvalue of a Graph with Long Pendant Paths
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.1006/jctb.2002.2132openalex-extracted
The Maximal Exceptional Graphs
inferredcites →https://doi.org/10.1016/j.dam.2013.09.012openalex-extracted
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
inferredcites →https://doi.org/10.1016/j.dam.2016.07.010openalex-extracted
Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
inferredcites →https://doi.org/10.1016/j.dam.2019.08.018openalex-extracted
The leaf-free graphs with nullity 2c(G)−1
inferredcites →https://doi.org/10.1016/j.dam.2022.01.008openalex-extracted
Graphs G with nullity 2c(G)+p(G)−1
inferredcites →https://doi.org/10.1016/j.disc.2011.11.024openalex-extracted
On graphs with an eigenvalue of maximal multiplicity
inferredcites →https://doi.org/10.1016/j.disc.2021.112786openalex-extracted
Graphs with nullity 2c(G)+p(G)−1
inferredcites →https://doi.org/10.1016/j.ejc.2008.07.021openalex-extracted
A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)
inferredcites →https://doi.org/10.1016/j.laa.2010.01.003openalex-extracted
On multiple eigenvalues of trees
inferredcites →https://doi.org/10.1016/j.laa.2011.06.039openalex-extracted
On the nullity of a graph with cut-points
inferredcites →https://doi.org/10.1016/j.laa.2013.08.003openalex-extracted
A note on the multiplicities of graph eigenvalues
inferredcites →https://doi.org/10.1016/j.laa.2019.09.007openalex-extracted
A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
inferredcites →https://doi.org/10.1016/j.laa.2019.09.013openalex-extracted
The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
inferredcites →https://doi.org/10.1016/j.laa.2022.03.010openalex-extracted
Graphs with eigenvalue −1 of multiplicity 2θ(G)+ρ(G)−1
inferredcites →https://doi.org/10.1016/s0012-365x(00)00187-4openalex-extracted
On the nullity of line graphs of trees
inferredcites →https://doi.org/10.1016/s0024-3795(98)10082-4openalex-extracted
On graphs with multiple eigenvalues
inferredcites →https://doi.org/10.1017/cbo9780511801518openalex-extracted
An Introduction to the Theory of Graph Spectra
inferredcites →https://doi.org/10.1023/a:1011209801191openalex-extracted
Graphs with Least Eigenvalue −2: The Star Complement Technique
inferredcites →https://doi.org/10.1080/03081087.2020.1838424openalex-extracted
On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices
inferredcites →https://doi.org/10.48550/arxiv.2306.13882openalex-extracted
The multiplicity of a Hermitian eigenvalue on 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.