On the public citation graph
�ber den Zusammenhang symmetrischer Graphen
0 signed · 66 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.1016/s0021-9800(67)80069-3openalex-snapshot
Regular line-symmetric graphs
inferredcites →https://doi.org/10.1215/s0012-7094-59-02667-5openalex-snapshot
The composition 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.10176openalex-snapshot
Regular 4‐critical graphs of even degree
inferred← citeshttps://doi.org/10.1002/jgt.20196openalex-snapshot
The 2‐dimensional rigidity of certain families of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20521openalex-snapshot
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
inferred← citeshttps://doi.org/10.1002/jgt.3190080406openalex-snapshot
Circulants and their connectivities
inferred← citeshttps://doi.org/10.1006/jctb.1999.1917openalex-snapshot
On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs
inferred← citeshttps://doi.org/10.1007/3-540-28347-1openalex-snapshot
Semantic Web and Peer-to-Peer: Decentralized Management and Exchange of Knowledge and Information
inferred← citeshttps://doi.org/10.1007/3-540-28347-1_5openalex-snapshot
Cayley DHTs — A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4419-9675-6_24openalex-snapshot
Percolation in the Hyperbolic Plane
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_2openalex-snapshot
Connectivity of Cayley Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30566-8_105openalex-snapshot
Cayley DHTs — A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72588-6_55openalex-snapshot
Connectivity of Connected Bipartite Graphs with Two Orbits
inferred← citeshttps://doi.org/10.1007/bf01224935openalex-snapshot
Connectivity of infinite graphs having a transitive torsion group action
inferred← citeshttps://doi.org/10.1007/bf01234384openalex-snapshot
Connectivity of minimal Cayley graphs
inferred← citeshttps://doi.org/10.1007/bf01433461openalex-snapshot
�ber den Zusammenhang von Graphen, mit Anwendungen auf symmetrische Graphen
inferred← citeshttps://doi.org/10.1007/bf01433466openalex-snapshot
Minimalen-fach kantenzusammenh�ngende Graphen
inferred← citeshttps://doi.org/10.1007/bf01534633openalex-snapshot
On the connectivities of finite and infinite graphs
inferred← citeshttps://doi.org/10.1007/bf01788663openalex-snapshot
Large fault-tolerant interconnection networks
inferred← citeshttps://doi.org/10.1007/bf02125895openalex-snapshot
The connectivities of locally finite primitive graphs
inferred← citeshttps://doi.org/10.1007/bfb0070361openalex-snapshot
Chromatic number and subgraphs of cayley graphs
inferred← citeshttps://doi.org/10.1007/s00373-007-0725-0openalex-snapshot
Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-011-1032-3openalex-snapshot
Super Connectivity and Super Edge Connectivity of the Mycielskian of a Graph
inferred← citeshttps://doi.org/10.1007/s00373-011-1104-4openalex-snapshot
On Vosperian and Superconnected Vertex-Transitive Digraphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1437-xopenalex-snapshot
Restricted Connectivity for Some Interconnection Networks
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90217-6openalex-snapshot
Connectivite des graphes de cayley abeliens sans K4
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00105-6openalex-snapshot
Small cutsets in quasiminimal Cayley graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00147-oopenalex-snapshot
Random packing by ρ-connected ρ-regular graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90138-zopenalex-snapshot
The connectivity of hierarchical Cayley digraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90281-eopenalex-snapshot
Factorisations courtes dans un groupe fini
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90140-jopenalex-snapshot
The covering radius of the cycle code of a graph
inferred← citeshttps://doi.org/10.1016/j.aml.2011.07.018openalex-snapshot
Super λ3 -optimality of regular graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.12.014openalex-snapshot
Using semidirect products of groups to build classes of interconnection networks
inferred← citeshttps://doi.org/10.1016/j.disc.2007.06.035openalex-snapshot
Maximally edge-connected and vertex-connected graphs and digraphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2010.12.018openalex-snapshot
Extremal infinite graph theory
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114259openalex-snapshot
The Jacobian of a graph and graph automorphisms
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115336openalex-snapshot
Chorded cycles in Chvátal-Erdős graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.09.004openalex-snapshot
Cubic inflation, mirror graphs, regular maps, and partial cubes
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.047openalex-snapshot
Archimedean solids of genus two
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.09.019openalex-snapshot
Reversals Cayley graphs of symmetric groups
inferred← citeshttps://doi.org/10.1016/s0195-6698(81)80042-xopenalex-snapshot
An Application of Connectivity Theory in Graphs to Factorizations of Elements in Groups
inferred← citeshttps://doi.org/10.1016/s0195-6698(84)80034-7openalex-snapshot
On the Connectivity of Cayley Digraphs
inferred← citeshttps://doi.org/10.1017/s0963548300000031openalex-snapshot
Local Expansion of Symmetrical Graphs
inferred← citeshttps://doi.org/10.1080/02533839.2026.2696915openalex-snapshot
Fault tolerance assessment for half-vertex transitive networks based on 3-extra edge fault pattern
inferred← citeshttps://doi.org/10.1080/17445760.2019.1659259openalex-snapshot
Cyclic vertex-connectivity of Cartesian product graphs
inferred← citeshttps://doi.org/10.1090/s0894-0347-00-00362-3openalex-snapshot
Percolation in the hyperbolic plane
inferred← citeshttps://doi.org/10.1137/130923646openalex-snapshot
$k$-Blocks: A Connectivity Invariant for Graphs
inferred← citeshttps://doi.org/10.1137/s089548019630635xopenalex-snapshot
On Isoperimetric Connectivity in Vertex-Transitive Graphs
inferred← citeshttps://doi.org/10.2140/involve.2025.18.79openalex-snapshot
New conditions for graph Hamiltonicity
inferred← citeshttps://doi.org/10.37236/6820openalex-snapshot
On the Connectivity of Graphs in Association Schemes
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0096openalex-snapshot
The Structure of Critical Product Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1305.4557openalex-snapshot
$k$-Blocks: a connectivity invariant for graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08109openalex-snapshot
Cayley graphs and symmetric interconnection networks
inferred← citeshttps://doi.org/10.48550/arxiv.1905.06959openalex-snapshot
Cometric Association Schemes
inferred← citeshttps://doi.org/10.48550/arxiv.math/9411221openalex-snapshot
Notes on the connectivity of Cayley coset digraphs
inferred← citeshttps://doi.org/10.58088/k8jr-sz91openalex-snapshot
Combinatorial and spectral properties of graphs and association schemes
inferred← citeshttps://doi.org/10.7151/dmgt.1360openalex-snapshot
Erdős regular graphs of even degree
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.