Image de couverture de livre

Randomized Zero Forcing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Geneson, Jesse, Hicks, Illya, Lichtenberg, Noah, Moon, Alvin, Robles, Nicolas
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics Discrete Mathematics 05C57, 05C20, 05C81, 60J10
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational
par: Sylvester, John
Publié: (2021)

Time-Biased Random Walks and Robustness of Expanders
par: Olesker-Taylor, Sam, et autres
Publié: (2024)

Geometric Bounds on the Fastest Mixing Markov Chain
par: Olesker-Taylor, Sam, et autres
Publié: (2021)

Deduction, Constrained Zero Forcing, and Constrained Searching
par: Burgess, Andrea, et autres
Publié: (2024)

Guarding isometric subgraphs and Cops and Robber in planar graphs
par: de la Maza, Sebastián González Hermosillo, et autres
Publié: (2024)

Probabilistic Zero Forcing with Vertex Reversion
par: Brennan, Zachary
Publié: (2024)

Multiple Random Walks on Graphs: Mixing Few to Cover Many
par: Rivera, Nicolás, et autres
Publié: (2020)

Improved bounds on the cop number when forbidding a minor
par: Kenter, Franklin, et autres
Publié: (2023)

Inversion diameter and 2-edge-colored homomorphisms
par: Arana, Carmen, et autres
Publié: (2026)

Localization game capture time of trees and outerplanar graphs
par: Chenoweth, Vesna Iršič, et autres
Publié: (2025)

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
par: Cameron, Thomas R., et autres
Publié: (2025)

On the Multi-Robber Damage Number
par: Stojaković, Miloš, et autres
Publié: (2022)

Cops and Attacking Robbers with Cycle Constraints
par: Clow, Alexander, et autres
Publié: (2024)

Any fully graphic region of degree sequences can be sampled rapidly
par: Erdős, Péter L., et autres
Publié: (2025)

Finite Vertex-colored Ultrahomogeneous Oriented Graphs
par: Heinrich, Irene, et autres
Publié: (2024)

Cops and Robbers, Clique Covers, and Induced Cycles
par: Clow, Alexander, et autres
Publié: (2025)

Random Walks and the Meeting Time for Trees
par: Beveridge, Andrew, et autres
Publié: (2025)

Random 2-cell embeddings of multistars
par: Loth, Jesse Campion, et autres
Publié: (2021)

Random Walks and the Best Meeting Time for Trees
par: Beveridge, Andrew, et autres
Publié: (2025)

Isomorphisms between dense random graphs
par: Surya, Erlang, et autres
Publié: (2023)

Robust Connectivity of Graphs on Surfaces
par: Bradshaw, Peter, et autres
Publié: (2021)

Homomorphically Full Oriented Graphs
par: Bellitto, Thomas, et autres
Publié: (2022)

The Burning Number Conjecture Holds Asymptotically
par: Norin, Sergey, et autres
Publié: (2022)

$4K_1$-free graph with the cop number $3$
par: Char, Arnab, et autres
Publié: (2025)

Cops and robbers on $P_5$-free graphs
par: Chudnovsky, Maria, et autres
Publié: (2023)

Graphs with unique Grundy dominating sets
par: Brešar, Boštjan, et autres
Publié: (2021)

Cover and Hitting Times of Hyperbolic Random Graphs
par: Kiwi, Marcos, et autres
Publié: (2022)

On 2-complexes embeddable in 4-space, and the excluded minors of their underlying graphs
par: Georgakopoulos, Agelos, et autres
Publié: (2024)

Information dissemination and confusion in signed networks
par: Jin, Ligang, et autres
Publié: (2024)

Well-Quasi-Ordering Eulerian Digraphs Embeddable in Surfaces by Strong Immersion
par: Cavallaro, Dario, et autres
Publié: (2025)

Basis number of bounded genus graphs
par: Lehner, Florian, et autres
Publié: (2024)

The damage number of the Cartesian product of graphs
par: Huggan, Melissa A., et autres
Publié: (2023)

Asymptotic size of the Karp-Sipser Core in Configuration Model
par: Chatterjee, Arnab, et autres
Publié: (2025)

Optimally reconnecting graphs against an edge-destroying adversary
par: McDonald, Daniel C.
Publié: (2021)

Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
par: Hatzel, Meike, et autres
Publié: (2024)

Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
par: Aboulker, Pierre, et autres
Publié: (2024)

On the Small Quasi-kernel conjecture
par: Erdős, Péter L., et autres
Publié: (2023)

The clique chromatic number of sparse random graphs
par: Fernandez V, Manuel, et autres
Publié: (2024)

On the concentration of the chromatic number of random graphs
par: Surya, Erlang, et autres
Publié: (2022)

Large independent sets in recursive Markov random graphs
par: Gupte, Akshay, et autres
Publié: (2022)