arXiv (All)
open access
The Zero Forcing Number of Graph Powers
The $k$-th power of a simple graph $G$, denoted $G^k$, is the graph with vertex set $V(G)$ where two vertices are adjacent if they are within distance $k$ in $G$. We investigate the zero forcing number of graph powers. Powers of graphs are much denser and generally not encompassed by existing result
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
- The $\ell$-degree Turán densities of hypergraphs: infinite families and their finite subfamilies#1342772
- Dichotomy results for classes of countable graphs#1297010
- Coloring Monomial Cayley Graphs: The One-Parameter Case#1233513
- Asymptotically Faster Algorithms for Recognizing $(k,\ell)$-Sparse Graphs#1325126
- Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient#1070654
Record · ID 1199166
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