On the public citation graph
Spektren endlicher grafen
0 signed · 518 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4892226openalex-extracted
Multiplicity of Any Eigenvalue of a Graph with Long Pendant Paths
inferred← citeshttps://doi.org/10.1002/9783527627981.ch1openalex-snapshot
Entropy, Orbits, and Spectra of Graphs
inferred← citeshttps://doi.org/10.1002/9783527645121.ch6openalex-snapshot
Graph‐Theoretical Descriptors for Branched Polymers
inferred← citeshttps://doi.org/10.1002/cplx.20248openalex-snapshot
Epidemic thresholds for infections in uncertain networks
inferred← citeshttps://doi.org/10.1002/jcc.540010410openalex-snapshot
Random walks and their diagnostic value for characterization of atomic environment
inferred← citeshttps://doi.org/10.1002/jcc.540030318openalex-snapshot
On evaluation of the characteristic polynomial for large molecules
inferred← citeshttps://doi.org/10.1002/jcc.540100510openalex-snapshot
On the construction of the matching polynomial for unbranched catacondensed benzenoids
inferred← citeshttps://doi.org/10.1002/jgt.10043openalex-snapshot
How local irregularity gets global in a graph
inferred← citeshttps://doi.org/10.1002/jgt.22057openalex-snapshot
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22578openalex-snapshot
Proof of a conjecture on the nullity of a graph
inferred← citeshttps://doi.org/10.1002/jgt.22883openalex-snapshot
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
inferred← citeshttps://doi.org/10.1002/mana.19881390105openalex-snapshot
Spectral Radius and Degree Sequence
inferred← citeshttps://doi.org/10.1002/mana.19941660119openalex-snapshot
A Note on Almost Regular Graphs
inferred← citeshttps://doi.org/10.1002/net.20250openalex-snapshot
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
inferred← citeshttps://doi.org/10.1002/qua.20688openalex-snapshot
Ordering the complements of trees by the number of maximum matchings
inferred← citeshttps://doi.org/10.1002/qua.560180853openalex-snapshot
Chemical graph theory. II. On the graph theoretical polynomials of conjugated structures
inferred← citeshttps://doi.org/10.1002/qua.560190107openalex-snapshot
The graph center concept for polycyclic graphs
inferred← citeshttps://doi.org/10.1002/qua.560280813openalex-snapshot
On the computation of characteristic polynomial of a chemical graph
inferred← citeshttps://doi.org/10.1002/qua.560300762openalex-snapshot
On some solved and unsolved problems of chemical graph theory
inferred← citeshttps://doi.org/10.1002/sapm1959381104openalex-snapshot
A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
inferred← citeshttps://doi.org/10.1007/3-540-06399-4_5openalex-snapshot
Graph theory and molecular orbitals
inferred← citeshttps://doi.org/10.1007/3-540-36586-9_18openalex-snapshot
Inverse Quantization for Resolution Conversion
inferred← citeshttps://doi.org/10.1007/3-540-48236-9_46openalex-snapshot
Discrete Mean Curvature Flow
inferred← citeshttps://doi.org/10.1007/3-540-51505-4_19openalex-snapshot
Scaling properties of topological invariants
inferred← citeshttps://doi.org/10.1007/3-540-51505-4_22openalex-snapshot
Calculating the numbers of perfect matchings and of spanning trees, Pauling's orders, the characteristic polynomial, and the eigenvectors of a benzenoid system
inferred← citeshttps://doi.org/10.1007/3-540-70659-3_13openalex-snapshot
Inexact Multisubgraph Matching Using Graph Eigenspace and Clustering Models
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_410openalex-snapshot
Polymers, Non-linearity in
inferred← citeshttps://doi.org/10.1007/978-0-8176-4789-6_14openalex-snapshot
Some Applications of Eigenvalues of Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4684-2556-7_1openalex-snapshot
Hückel Theory and Topology
inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8_7openalex-snapshot
Linear Time Algorithm to Check the Singularity of Block Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-55857-4_20openalex-snapshot
Extremal Singular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-12288-0_4openalex-snapshot
Spectral Methods in Representation Theory
inferred← citeshttps://doi.org/10.1007/978-3-032-01708-6_2openalex-snapshot
Graph Properties and Min-Max Principle
inferred← citeshttps://doi.org/10.1007/978-3-0348-5936-3_2openalex-snapshot
Graphen bei Ornamenten und Verzweigungsdiagrammen
inferred← citeshttps://doi.org/10.1007/978-3-642-16339-5_7openalex-snapshot
On the Nullity Algorithm of Tree and Unicyclic Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-37502-6_69openalex-snapshot
Bicyclic Graphs with Nullity n−5
inferred← citeshttps://doi.org/10.1007/978-3-642-61279-4_2openalex-snapshot
Topology and Properties of Molecules
inferred← citeshttps://doi.org/10.1007/978-3-642-70982-1_6openalex-snapshot
Graph Theory and Molecular Orbitals
inferred← citeshttps://doi.org/10.1007/978-94-011-1202-4_1openalex-snapshot
Introduction to Graph Theory
inferred← citeshttps://doi.org/10.1007/978-981-99-2310-6_8openalex-snapshot
Nullity of Graphs—A Survey and Some New Results
inferred← citeshttps://doi.org/10.1007/bf00526290openalex-snapshot
Characteristic polynomials of chemical graphs via symmetric function theory
inferred← citeshttps://doi.org/10.1007/bf00527527openalex-snapshot
Properties and derivation of the fourth and sixth coefficients of the characteristic polynomial of molecular graphs?New graphical invariants
inferred← citeshttps://doi.org/10.1007/bf00527654openalex-snapshot
Graph theory and molecular orbitals
inferred← citeshttps://doi.org/10.1007/bf00550410openalex-snapshot
The characteristic polynomials of structures with pending bonds
inferred← citeshttps://doi.org/10.1007/bf00551119openalex-snapshot
Spectral analysis of graphs by cyclic automorphism subgroups
inferred← citeshttps://doi.org/10.1007/bf00551166openalex-snapshot
Symmetry factoring of the characteristic equations of graphs corresponding to polyhedra
inferred← citeshttps://doi.org/10.1007/bf00552592openalex-snapshot
Chemical applications of group theory and topology
inferred← citeshttps://doi.org/10.1007/bf00552651openalex-snapshot
Analysis of the topological dependency of the characteristic polynomial in its chebyshev expansion
inferred← citeshttps://doi.org/10.1007/bf00557925openalex-snapshot
On alternative form of the characteristic polynomial and the problem of graph recognition
inferred← citeshttps://doi.org/10.1007/bf01046555openalex-snapshot
A topological index for the total?-electron energy
inferred← citeshttps://doi.org/10.1007/bf01164200openalex-snapshot
Nonisomorphic graphs with identical atomic counts of self-returning walks: Isocodal graphs
inferred← citeshttps://doi.org/10.1007/bf01164840openalex-snapshot
In search of structural invariants
inferred← citeshttps://doi.org/10.1007/bf01166272openalex-snapshot
The golden jubilee of the Coulson-Rushbrooke pairing theorem
inferred← citeshttps://doi.org/10.1007/bf01167201openalex-snapshot
The characteristic polynomial of a chemical graph
inferred← citeshttps://doi.org/10.1007/bf01200830openalex-snapshot
H�ckel and M�bius cyclic conjugated molecules
inferred← citeshttps://doi.org/10.1007/bf01901979openalex-snapshot
Automorphism group and category of cospectral graphs
inferred← citeshttps://doi.org/10.1007/bf02136028openalex-snapshot
On the power of a perturbation for testing non-isomorphism of graphs
inferred← citeshttps://doi.org/10.1007/bf02260499openalex-snapshot
Computing the characteristic polynomial of a tree
inferred← citeshttps://doi.org/10.1007/bf02476603openalex-snapshot
Entropy and the complexity of graphs: III. Graphs with prescribed information content
inferred← citeshttps://doi.org/10.1007/bfb0066434openalex-snapshot
Which graphs have integral spectra?
inferred← citeshttps://doi.org/10.1007/bfb0066438openalex-snapshot
Computing the Characteristic polynomial of a graph
inferred← citeshttps://doi.org/10.1007/bfb0097370openalex-snapshot
Some computational results on the spectra of graphs
inferred← citeshttps://doi.org/10.1007/s00010-019-00687-0openalex-snapshot
Permanent, determinant, and rank of bi-block graphs
inferred← citeshttps://doi.org/10.1007/s00236-026-00527-0openalex-snapshot
Graphs of order n with exactly $$n+1$$ complementarity eigenvalues
inferred← citeshttps://doi.org/10.1007/s00373-008-0825-5openalex-snapshot
On the Nullity of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1831-2openalex-snapshot
Coefficients of the Characteristic Polynomial of the (Signless, Normalized) Laplacian of a Graph
inferred← citeshttps://doi.org/10.1007/s00373-019-02112-4openalex-snapshot
Extremal Problems Involving the Two Largest Complementarity Eigenvalues of a Graph
inferred← citeshttps://doi.org/10.1007/s00373-020-02260-yopenalex-snapshot
Measuring Similarity Between Connected Graphs: The Role of Induced Subgraphs and Complementarity Eigenvalues
inferred← citeshttps://doi.org/10.1007/s00453-013-9766-3openalex-snapshot
Inequalities for the Number of Walks in Graphs
inferred← citeshttps://doi.org/10.1007/s10114-017-6241-0openalex-snapshot
Enumeration of cubic Cayley graphs on dihedral groups
inferred← citeshttps://doi.org/10.1007/s10587-014-0129-2openalex-snapshot
Some properties of the distance Laplacian eigenvalues of a graph
inferred← citeshttps://doi.org/10.1007/s10587-016-0304-8openalex-snapshot
Coalescing Fiedler and core vertices
inferred← citeshttps://doi.org/10.1007/s10801-023-01218-6openalex-snapshot
Characterization of digraphs with three complementarity eigenvalues
inferred← citeshttps://doi.org/10.1007/s10878-019-00397-yopenalex-snapshot
The rank of a complex unit gain graph in terms of the rank of its underlying graph
inferred← citeshttps://doi.org/10.1007/s10878-019-00440-yopenalex-snapshot
The $$\alpha $$-spectral radius of uniform hypergraphs concerning degrees and domination number
inferred← citeshttps://doi.org/10.1007/s10878-021-00704-6openalex-snapshot
Some mixed graphs with H-rank 4, 6 or 8
inferred← citeshttps://doi.org/10.1007/s11227-022-04724-9openalex-snapshot
Graph entropies-graph energies indices for quantifying network structural irregularity
inferred← citeshttps://doi.org/10.1007/s11253-023-02209-3openalex-snapshot
Cospectral Quantum Graphs with Dirichlet Conditions at Pendant Vertices
inferred← citeshttps://doi.org/10.1007/s12190-019-01279-6openalex-snapshot
On the Upper Bounds for the Degree Deviation of Graphs
inferred← citeshttps://doi.org/10.1007/s12190-023-01845-zopenalex-snapshot
On irregularity indices and main eigenvalues of graphs and their applicability
inferred← citeshttps://doi.org/10.1007/s12190-025-02405-3openalex-snapshot
Degree scaling irregularities
inferred← citeshttps://doi.org/10.1007/s13675-012-0001-9openalex-snapshot
Open problems on graph eigenvalues studied with AutoGraphiX
inferred← citeshttps://doi.org/10.1007/s40314-025-03191-1openalex-snapshot
Determination of some graphs by resistance spectra
inferred← citeshttps://doi.org/10.1007/s40314-025-03548-6openalex-snapshot
Characterization of graphs with rank $$2v(G)-2\alpha (G)-2c(G)+1$$
inferred← citeshttps://doi.org/10.1007/s40314-026-03698-1openalex-snapshot
The left row rank of quaternion unit gain graphs in terms of girth
inferred← citeshttps://doi.org/10.1007/s40324-021-00275-wopenalex-snapshot
The many facets of the Estrada indices of graphs and networks
inferred← citeshttps://doi.org/10.1007/s40819-023-01588-2openalex-snapshot
Bounds of the Largest $$A_\alpha $$ Eigenvalue of a Graph of Girth 5 or More
inferred← citeshttps://doi.org/10.1007/s40840-019-00811-yopenalex-snapshot
Adjacency Rank and Independence Number of a Signed Graph
inferred← citeshttps://doi.org/10.1007/s40840-025-01838-0openalex-snapshot
Existence of a Non-Zero (0, 1)-Vector in the Row Space of Adjacency Matrices of Simple Graphs
inferred← citeshttps://doi.org/10.1007/s41109-017-0042-3openalex-snapshot
Identifying network structure similarity using spectral graph theory
inferred← citeshttps://doi.org/10.1007/s41109-020-00273-3openalex-snapshot
Normalised degree variance
inferred← citeshttps://doi.org/10.1007/s41109-023-00544-9openalex-snapshot
Parameterizing network graph heterogeneity using a modified Weibull distribution
inferred← citeshttps://doi.org/10.1007/s42967-026-00585-8openalex-snapshot
On the Determination of Some Graphs by Resistance Spectra
inferred← citeshttps://doi.org/10.1016/0001-8708(78)90005-1openalex-snapshot
Distance matrix polynomials of trees
inferred← citeshttps://doi.org/10.1016/0009-2614(74)80135-1openalex-snapshot
Conjugated molecules having integral graph spectra
inferred← citeshttps://doi.org/10.1016/0009-2614(78)89103-9openalex-snapshot
On the quest for an isomorphism invariant which characterises finite chemical graphs
inferred← citeshttps://doi.org/10.1016/0009-2614(82)83476-3openalex-snapshot
Some more difficulties with topological resonance energy
inferred← citeshttps://doi.org/10.1016/0009-2614(88)87127-6openalex-snapshot
Graph-theoretical study of a novel relationship between the molecular π-electronic framework and the energy eigenvalues
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90088-xopenalex-snapshot
A graph polynomial and its applications
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90003-0openalex-snapshot
On the distance matrix of a tree
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90007-gopenalex-snapshot
Bounds of eigenvalues of graphs
inferred← citeshttps://doi.org/10.1016/0021-8693(76)90162-9openalex-snapshot
Line graphs, root systems, and elliptic geometry
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90193-xopenalex-snapshot
Tight bounds on the spectral radius of asymmetric nonnegative matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90067-7openalex-snapshot
On the maximal index of connected graphs
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90167-uopenalex-snapshot
On the geometry and Laplacian of a graph
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90004-topenalex-snapshot
A note on the irregularity of graphs
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90372-hopenalex-snapshot
The symbiotic relationship of combinatorics and matrix theory
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00236-sopenalex-snapshot
On the largest kth eigenvalues of trees
inferred← citeshttps://doi.org/10.1016/0040-4020(75)85002-2openalex-snapshot
Isospectral graphs and molecules
inferred← citeshttps://doi.org/10.1016/0095-8956(72)90023-8openalex-snapshot
The characteristic polynomial of a graph
inferred← citeshttps://doi.org/10.1016/0166-1280(89)85008-0openalex-snapshot
Isospectbal graphs revisited
inferred← citeshttps://doi.org/10.1016/0166-218x(80)90031-1openalex-snapshot
On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph
inferred← citeshttps://doi.org/10.1016/0377-0427(85)90039-1openalex-snapshot
Computing and interpreting the adjacency spectrum of traffic networks
inferred← citeshttps://doi.org/10.1016/b978-0-12-189420-7.50009-8openalex-snapshot
STRONGLY REGULAR GRAPHS OF L2-TYPE AND OF TRIANGULAR TYPE
inferred← citeshttps://doi.org/10.1016/b978-0-12-189420-7.50021-9openalex-snapshot
Line Graphs, Root Systems, and Elliptic Geometry
inferred← citeshttps://doi.org/10.1016/b978-0-12-802068-5.00004-xopenalex-snapshot
Spectral Radius and Other Graph Invariants
inferred← citeshttps://doi.org/10.1016/b978-1-4832-3187-7.50016-7openalex-snapshot
ALGEBRAIC ISOMORPHISM INVARIANTS FOR GRAPHS OF AUTOMATA††This work was supported by the U.S. Air Force, Rome Air Development Center under Contract AF30 (602)-3546. It is derived from a disertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy at The…
inferred← citeshttps://doi.org/10.1016/j.amc.2011.02.033openalex-snapshot
Extremal graph characterization from the bounds of the spectral radius of weighted graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2012.09.073openalex-snapshot
Bounds on the spectral radii of digraphs in terms of walks
inferred← citeshttps://doi.org/10.1016/j.amc.2016.10.019openalex-snapshot
Some new lower bounds for energy of graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2017.05.064openalex-snapshot
Generalizations of Szőkefalvi Nagy and Chebyshev inequalities with applications in spectral graph theory
inferred← citeshttps://doi.org/10.1016/j.amc.2017.06.018openalex-snapshot
Random neighborhood graphs as models of fracture networks on rocks: Structural and dynamical analysis
inferred← citeshttps://doi.org/10.1016/j.amc.2017.12.025openalex-snapshot
Cospectrality of graphs with respect to distance matrices
inferred← citeshttps://doi.org/10.1016/j.amc.2018.10.010openalex-snapshot
On some properties of graph irregularity indices with a particular regard to the σ-index
inferred← citeshttps://doi.org/10.1016/j.amc.2022.126957openalex-snapshot
The multiplicities of eigenvalues of a graph
inferred← citeshttps://doi.org/10.1016/j.amc.2022.127233openalex-snapshot
On Hosoya’s dormants and sprouts
inferred← citeshttps://doi.org/10.1016/j.arabjc.2021.103567openalex-snapshot
Irregularity molecular descriptors of Cerium oxide CeO2 based on mathematical model and calculation
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.01.021openalex-snapshot
Sharp bounds on the eigenvalues of trees
inferred← citeshttps://doi.org/10.1016/j.chaos.2022.111925openalex-snapshot
On total irregularity index of trees with given number of segments or branching vertices
inferred← citeshttps://doi.org/10.1016/j.chemolab.2022.104494openalex-snapshot
A note on neighborhood first Zagreb energy and its significance as a molecular descriptor
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.027openalex-snapshot
Ordering graphs with index in the interval (2,2+5)
inferred← citeshttps://doi.org/10.1016/j.dam.2013.09.012openalex-snapshot
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
inferred← citeshttps://doi.org/10.1016/j.dam.2013.10.002openalex-snapshot
Matrix power inequalities and the number of walks in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.07.010openalex-snapshot
Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
inferred← citeshttps://doi.org/10.1016/j.dam.2019.04.018openalex-snapshot
No graph with nullity η(G)=|V(G)|−2m(G)+2c(G)−1
inferred← citeshttps://doi.org/10.1016/j.dam.2019.08.018openalex-snapshot
The leaf-free graphs with nullity 2c(G)−1
inferred← citeshttps://doi.org/10.1016/j.dam.2020.05.033openalex-snapshot
Kemeny’s constant for several families of graphs and real-world networks
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.028openalex-snapshot
A linear time algorithm for the nullity of vertex-weighted block graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.04.025openalex-snapshot
The characteristic polynomial of a graph containing loops
inferred← citeshttps://doi.org/10.1016/j.dam.2021.07.006openalex-snapshot
On conjectures of network distance measures by using graph spectra
inferred← citeshttps://doi.org/10.1016/j.dam.2022.01.020openalex-snapshot
Relation between the nullity of a graph and its matching number
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.020openalex-snapshot
Irregularities of maximal k -degenerate graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.07.021openalex-snapshot
The gap between the rank of a complex unit gain graph and its underlying graph
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.05.006openalex-snapshot
Relation between the H-rank of a mixed graph and the girth of its underlying graph
inferred← citeshttps://doi.org/10.1016/j.dam.2025.05.038openalex-snapshot
The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.005openalex-snapshot
A characterization of graphs with two types of eigenvalue multiplicities equal to n − d − 1
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.007openalex-snapshot
Which graphs are determined by their total number of walks?
inferred← citeshttps://doi.org/10.1016/j.dam.2026.09.004openalex-snapshot
Complex unit gain graphs with rank 2n(G)−2α(G)−2c(G)+1
inferred← citeshttps://doi.org/10.1016/j.disc.2003.08.005openalex-snapshot
Some new bounds on the spectral radius of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.02.005openalex-snapshot
On the index of bicyclic graphs with perfect matchings
inferred← citeshttps://doi.org/10.1016/j.disc.2013.03.011openalex-snapshot
Determinants of grids, tori, cylinders and Möbius ladders
inferred← citeshttps://doi.org/10.1016/j.disc.2013.07.006openalex-snapshot
On the determinant of bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.11.023openalex-snapshot
Characterization of graphs with given order, given size and given matching number that minimize nullity
inferred← citeshttps://doi.org/10.1016/j.disc.2017.01.018openalex-snapshot
Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112119openalex-snapshot
Singular graphs with dihedral group action
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112303openalex-snapshot
A note lower bounds for the Estrada index
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112618openalex-snapshot
A large family of cospectral Cayley graphs over dicyclic groups
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112630openalex-snapshot
A spectral version of Mantel's theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112786openalex-snapshot
Graphs with nullity 2c(G)+p(G)−1
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112851openalex-snapshot
Nullity and singularity of a graph in which every block is a cycle
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112919openalex-snapshot
The nullity of a graph with fractional matching number
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112973openalex-snapshot
Generalizing theorems of Nosal and Nikiforov: Triangles and quadrilaterals
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113290openalex-snapshot
Eigenvalues and parity factors in graphs with given minimum degree
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114421openalex-snapshot
High-order spectral characterizations of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115119openalex-snapshot
Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.05.004openalex-snapshot
A sufficient condition for a family of graphs being determined by their generalized spectra
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.03.043openalex-snapshot
The spread of the unicyclic graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.02.034openalex-snapshot
On the irregularity of uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.12.059openalex-snapshot
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
inferred← citeshttps://doi.org/10.1016/j.ins.2014.07.018openalex-snapshot
Probabilistic inequalities for evaluating structural network measures
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.05.008openalex-snapshot
NP-hardness and inapproximability of sparse PCA
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2025.08.038openalex-snapshot
Singular Cayley graphs and p-blocks of finite groups
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2026.07.030openalex-snapshot
A complete classification of Cay-DS Cayley graphs on the dihedral group D2p
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.07.004openalex-snapshot
A simple arithmetic criterion for graphs being determined by their generalized spectra
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.09.003openalex-snapshot
On spectral radii of unraveled balls
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2005.04.006openalex-snapshot
Some further development on the eigensystem approach for graph isomorphism detection
inferred← citeshttps://doi.org/10.1016/j.jmaa.2018.10.039openalex-snapshot
Gaussianization of the spectra of graphs and networks. Theory and applications
inferred← citeshttps://doi.org/10.1016/j.laa.2005.06.012openalex-snapshot
On the nullity of unicyclic graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2005.10.011openalex-snapshot
Eigenvalues and degree deviation in graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2005.10.043openalex-snapshot
A new upper bound for the spectral radius of graphs with girth at least 5
inferred← citeshttps://doi.org/10.1016/j.laa.2006.02.003openalex-snapshot
Walks and the spectral radius of graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2006.08.020openalex-snapshot
Bounds on graph eigenvalues I
inferred← citeshttps://doi.org/10.1016/j.laa.2006.10.020openalex-snapshot
Large matchings from eigenvalues
inferred← citeshttps://doi.org/10.1016/j.laa.2006.11.027openalex-snapshot
Research problems from the Aveiro Workshop on Graph Spectra
inferred← citeshttps://doi.org/10.1016/j.laa.2006.11.028openalex-snapshot
Starlike trees are determined by their Laplacian spectrum
inferred← citeshttps://doi.org/10.1016/j.laa.2007.02.031openalex-snapshot
The proof on the conjecture of extremal graphs for the kth eigenvalues of trees
inferred← citeshttps://doi.org/10.1016/j.laa.2007.05.036openalex-snapshot
The minimum rank of symmetric matrices described by a graph: A survey
inferred← citeshttps://doi.org/10.1016/j.laa.2007.06.017openalex-snapshot
On the null-spaces of acyclic and unicyclic singular graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2007.07.010openalex-snapshot
Bounds on graph eigenvalues II
showing the first 200 of 518 · page through all 518
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.