arXiv (All)
open access
Maximizing the discrepancy between zero forcing parameters relative to graph order
Zero forcing is a process described by a color change rule on the vertices of a graph. In this paper, we maximize the discrepancy between various zero forcing parameters relative to graph order. First, we find an upper bound on the difference in cardinality between minimal zero forcing sets (sets co
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
- $(2,\mathcal{F})$-Avoiding Coloring and B-Coloring under Bipartite Exclusions#1144883
- Multiset Colorings of Random Graphs Across Density Regimes#1049104
- Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity#271808
- Conflict-Free Coloring Planar Graphs with 4 Colors#615074
- Conflict-Free Coloring Planar Graphs with 4 Colors#614107
Record · ID 1130103
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