On the public citation graph

Graph derivatives

0 signed · 113 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/bf01890539openalex-snapshot
Graphentransformationen
inferredcites →https://doi.org/10.1215/s0012-7094-59-02667-5openalex-snapshot
The composition of graphs
inferredcites →https://doi.org/10.1515/crll.1960.203.35openalex-snapshot
Über die explizite Automorphismengruppe von speziellen Graphen.
inferredcites →https://doi.org/10.2307/2371086openalex-snapshot
Congruent Graphs and the Connectivity of Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.22420openalex-snapshot
Fractal graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190030402openalex-snapshot
A bibliography of graph equations
inferred← citeshttps://doi.org/10.1002/malq.19800260702openalex-snapshot
On Intervals in Relational Structures
inferred← citeshttps://doi.org/10.1002/mana.19740590104openalex-snapshot
Der Arboreszenzengraph eines gerichteten Graphen
inferred← citeshttps://doi.org/10.1002/mana.19790870107openalex-snapshot
Cohomomorphisms of graphs and hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_2openalex-snapshot
Line Graph Isomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_10openalex-snapshot
Essential Spectra of 2 × 2 Block Operator Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_11openalex-snapshot
Essential Spectra of 3 × 3 Block Operator Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_12openalex-snapshot
Spectral Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_13openalex-snapshot
Applications in Mathematical Physics and Biology
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_2openalex-snapshot
Fundamentals
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_3openalex-snapshot
Fredholm Operators and Riesz Theory for Polynomially Compact Operators
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_4openalex-snapshot
Time-Asymptotic Description of the Solution for an Abstract Cauchy Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_5openalex-snapshot
Fredholm Theory Related to Some Measures
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_6openalex-snapshot
Perturbation Results
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_7openalex-snapshot
Essential Spectra of Linear Operators
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_8openalex-snapshot
Pseudo-Spectra
inferred← citeshttps://doi.org/10.1007/978-3-319-17566-9_9openalex-snapshot
S-Essential Spectra
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_6openalex-snapshot
The Calculation of Invariants for Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_2openalex-snapshot
Algorithmic Aspects of Comparability Graphs and Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_4openalex-snapshot
Graph homomorphisms: structure and symmetry
inferred← citeshttps://doi.org/10.1007/bf01110333openalex-snapshot
Existence and structure of self-adjoint graphs
inferred← citeshttps://doi.org/10.1007/bf01237575openalex-snapshot
Endomorphisms of graphs I. The monoid of strong endomorphisms
inferred← citeshttps://doi.org/10.1007/bf01304186openalex-snapshot
Vertex-transitive graphs
inferred← citeshttps://doi.org/10.1007/bf02460054openalex-snapshot
On the complexity of graphs and molecules
inferred← citeshttps://doi.org/10.1007/bf03352997openalex-snapshot
The Strongly Perfectness of Normal Product of t-Perfect Graphs
inferred← citeshttps://doi.org/10.1007/bfb0060111openalex-snapshot
Incidence patterns of graphs and complexes
inferred← citeshttps://doi.org/10.1007/bfb0066450openalex-snapshot
Absolute retracts in graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1419-zopenalex-snapshot
Uniquely Derived Generalized Line Graphs and Uniquely Represented Signed Graphs with Least Eigenvalues $$\ge $$ ≥ $$-2$$ - 2
inferred← citeshttps://doi.org/10.1007/s00493-008-2314-0openalex-snapshot
Decomposing simple permutations, with enumerative consequences
inferred← citeshttps://doi.org/10.1007/s00493-020-4324-5openalex-snapshot
Probabilistic Refinement of the Asymptotic Spectrum of Graphs
inferred← citeshttps://doi.org/10.1007/s10474-015-0487-8openalex-snapshot
Connectivity and other invariants of generalized products of graphs
inferred← citeshttps://doi.org/10.1007/s10479-010-0716-zopenalex-snapshot
A supernodal formulation of vertex colouring with applications in course timetabling
inferred← citeshttps://doi.org/10.1007/s10623-016-0209-4openalex-snapshot
Distance-regular Cayley graphs with least eigenvalue $$-2$$ - 2
inferred← citeshttps://doi.org/10.1007/s10801-023-01242-6openalex-snapshot
Representations of signed graphs
inferred← citeshttps://doi.org/10.1007/s10910-015-0510-xopenalex-snapshot
Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach
inferred← citeshttps://doi.org/10.1007/s11587-020-00520-wopenalex-snapshot
On the order supergraph of the power graph of a finite group
inferred← citeshttps://doi.org/10.1016/0012-365x(71)90014-8openalex-snapshot
Homomorphisms of derivative graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90100-3openalex-snapshot
Graphs indecomposable with respect to the X-join
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90109-xopenalex-snapshot
Point determination in graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90099-6openalex-snapshot
Graph with given achromatic number
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90087-0openalex-snapshot
Nuclei for totally point determining graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90138-2openalex-snapshot
Partitive hypergraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90035-9openalex-snapshot
Almost all comparability graphs are UPO
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90062-7openalex-snapshot
A retraction problem in graph theory
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90132-3openalex-snapshot
1-Intersecting families
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90277-mopenalex-snapshot
Endomorphism spectra of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(72)90058-5openalex-snapshot
Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90056-xopenalex-snapshot
Symmetric graphs and interpretations
inferred← citeshttps://doi.org/10.1016/0097-3165(85)90061-5openalex-snapshot
On the helly property working as a compactness criterion on graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(79)90043-xopenalex-snapshot
On the X-join decomposition for undirected graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90180-iopenalex-snapshot
P4-trees and substitution decomposition
inferred← citeshttps://doi.org/10.1016/j.akcej.2018.08.006openalex-snapshot
The distinguishing number and the distinguishing index of line and graphoidal graph(s)
inferred← citeshttps://doi.org/10.1016/j.akcej.2018.09.006openalex-snapshot
Spectral properties of the commuting graphs of certain groups
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.03.008openalex-snapshot
The chromatic distinguishing index of certain graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.013openalex-snapshot
On self-clique shoal graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.016openalex-snapshot
Grundy dominating sequences on X -join product
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.065openalex-snapshot
A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.008openalex-snapshot
Asymptotic enumeration of 2-covers and line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.11.039openalex-snapshot
On unretractive graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.027openalex-snapshot
Generalized symmetry of graphs — A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2016.04.022openalex-snapshot
Graphs with maximum Laplacian and signless Laplacian Estrada index
inferred← citeshttps://doi.org/10.1016/j.disc.2016.06.005openalex-snapshot
Infinite families of directed strongly regular graphs using equitable partitions
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111914openalex-snapshot
A hierarchy of dismantlings in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112972openalex-snapshot
Tournaments with maximal decomposability
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.08.019openalex-snapshot
The structure and metric dimension of the power graph of a finite group
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.09.005openalex-snapshot
Automorphism groups of supergraphs of the power graph of a finite group
inferred← citeshttps://doi.org/10.1016/j.laa.2012.06.027openalex-snapshot
Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00177-xopenalex-snapshot
On semi-P4-sparse graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00180-xopenalex-snapshot
Scattering number and modular decomposition
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00358-5openalex-snapshot
On the closure of graphs under substitution
inferred← citeshttps://doi.org/10.1016/s0021-9800(68)80017-1openalex-snapshot
The group of an X-join of graphs
inferred← citeshttps://doi.org/10.1016/s0021-9800(68)80046-8openalex-snapshot
The least number of edges for graphs having symmetric automorphism group
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70080-3openalex-snapshot
On a Family of Selfcomplementary Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70464-3openalex-snapshot
The Existence Problem for Graph Homomorphisms
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72966-9openalex-snapshot
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73267-5openalex-snapshot
Homomorphism Interpolation and Approximation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00017-7openalex-snapshot
Nesting of prime substructures in k-ary relations
inferred← citeshttps://doi.org/10.1016/s0924-6509(09)70352-6openalex-snapshot
WITHDRAWN: References
inferred← citeshttps://doi.org/10.1017/s1446788700014907openalex-snapshot
On Sylow graphs
inferred← citeshttps://doi.org/10.1051/ita/1979130100031openalex-snapshot
Nombre de sauts et graphes série-parallèles
inferred← citeshttps://doi.org/10.1080/00927872.2019.1659284openalex-snapshot
Combinatorial properties of power graphs of finite groups of prime order elements
inferred← citeshttps://doi.org/10.1080/00927872.2022.2125982openalex-snapshot
Counting Centralizers of a Finite Group with an Application in Constructing the Commuting Conjugacy Class Graph
inferred← citeshttps://doi.org/10.1080/03081087.2016.1221375openalex-snapshot
The Spectra of power graphs of certain finite groups
inferred← citeshttps://doi.org/10.1109/tit.2023.3298988openalex-snapshot
Asymptotic Equipartition Property for a Markov Source Having Ambiguous Alphabet
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb17773.xopenalex-snapshot
AN INTRODUCTION TO THE CATEGORY OF GRAPHS*
inferred← citeshttps://doi.org/10.1112/s0025579310001518openalex-snapshot
SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES
inferred← citeshttps://doi.org/10.1137/0603021openalex-snapshot
Decomposition of Directed Graphs
inferred← citeshttps://doi.org/10.1137/070708093openalex-snapshot
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
inferred← citeshttps://doi.org/10.1142/s0219498822500281openalex-snapshot
Zero-divisor graph of semisimple group-rings
inferred← citeshttps://doi.org/10.1142/s1793830922501087openalex-snapshot
Connectivity of superpower graphs of some non-abelian finite groups
inferred← citeshttps://doi.org/10.1145/58562.59300openalex-snapshot
Incremental modular decomposition
inferred← citeshttps://doi.org/10.1201/b10959-42openalex-snapshot
Near Products
inferred← citeshttps://doi.org/10.1515/dema-2016-0023openalex-snapshot
Interval Decomposition Lattices are Balanced
inferred← citeshttps://doi.org/10.1515/math-2019-0088openalex-snapshot
The general position problem and strong resolving graphs
inferred← citeshttps://doi.org/10.1515/math-2025-0187openalex-snapshot
Green's graphs of a semigroup
inferred← citeshttps://doi.org/10.2140/involve.2019.12.1329openalex-snapshot
Edge-transitive graphs and combinatorial designs
inferred← citeshttps://doi.org/10.2140/involve.2024.17.85openalex-snapshot
Edge-determining sets and determining index
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-4488openalex-snapshot
Commuting graph of CA−groups
inferred← citeshttps://doi.org/10.26637/mjm104/015openalex-snapshot
Embedding in distance degree regular and distance degree injective graphs
inferred← citeshttps://doi.org/10.2989/16073606.2016.1241958openalex-snapshot
The Zero Divisor Graph of 2 × 2 Matrices Over a Field
inferred← citeshttps://doi.org/10.3390/sym13071227openalex-snapshot
Connectivity of Semiring Valued Graphs
inferred← citeshttps://doi.org/10.3934/era.2026093openalex-snapshot
Notes on the equitable graph of type II of a finite group
inferred← citeshttps://doi.org/10.3934/era.2026230openalex-snapshot
Certain properties of the proper trivial intersection power graph associated with a finite group
inferred← citeshttps://doi.org/10.4153/cmb-1978-079-5openalex-snapshot
Properties of Hereditary Hypergraphs and Middle Graphs
inferred← citeshttps://doi.org/10.5539/jmr.v1n1p1openalex-snapshot
Eccentric Coloring of a Graph
inferred← citeshttps://doi.org/10.7151/dmgt.1793openalex-snapshot
On •-line signed graphs L_{•}(S)
inferred← citeshttps://doi.org/10.7151/dmgt.1903openalex-snapshot
Edge-transitivity of Cayley graphs generated by transpositions
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.