arXiv (All)
open access
Vertex Connectivity of Friends-and-strangers Graphs
Friends-and-strangers graphs, coined by Defant and Kravitz, are denoted by $\mathsf{FS}(X,Y)$ where $X$ and $Y$ are both graphs on $n$ vertices. The graph $X$ represents positions and edges mark adjacent positions while the graph $Y$ represents people and edges mark friendships. The vertex set of $\
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
- Common pairs of graphs#628826
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- Zeros of the independence polynomial on recursive sequences of graphs#1129703
- The number of common flowers of two STS (v)s and embeddable Steiner triple trades#954706
- Lorentzian polynomials and log-concavity of the independence polynomials of graphs#1141872
Record · ID 972883
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