arXiv (All)
open access
The Algebraic Connectivity and Laplacian Spectral Radius of Token Graphs
For a graph $G=(V,E)$ of order $n$ and an integer $k$ between $1$ and $\lfloor\frac{n}{2}\rfloor$, its token graph $F_k(G)$ is the graph whose vertices consist of the $\binom{n}{k}$ $k$-subsets of $V$, and two vertices of $F_k(G)$ are adjacent whenever their symmetric difference is an edge in $E$. I
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
- Improved bounds for the lazy cops and robbers on generalized hypercubes#927470
- LexFlip: A Dissociation Diagnostic for Legal Meaning Preservation Metrics#972232
- Classification of prime graphs with 2-switch-degree at most 4#1154535
- Geometric Configurations of Perturbed Jailbreak Prompts#394334
- Topological Optical Frequency Combs#1049982
Record · ID 1155435
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