arXiv (All)
open access
Laplacian Pair State Transfer on Edge Coronas
Let $G$ be a graph with edge set $E(G) = \{e_1, \ldots, e_m\}$, and let $\mathcal{H} = (H_1, \ldots, H_m)$ be an $m$-tuple of graphs. The edge corona $G\diamond\mathcal{H}$ is obtained from the disjoint union of $G,H_1,\ldots,H_m$ by joining both end vertices of each edge $e_j$ to every vertex of $H
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Stable Filters for Generative Modeling of Graph Signals#1012925
- Stable Filters for Generative Modeling of Graph Signals#965420
- Policy-GNN: Aggregation Optimization for Graph Neural Networks#19750
- SoK: Adversarial Robustness of the Variational Quantum Eigensolver via Red-Teaming#386735
- Pro-Generative Adversarial Network and V-stack Perceptron, Diamond Holographic Principle, and Pro-Temporal Emergence#720611
Record · ID 1536681
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive