Cover Image

A characterization of always solvable trees in the Lights Out game using the activation types of vertices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Batal, Ahmet
Format:	Preprint
Published:	2020
Subjects:	Combinatorics 05C50, 05C05, 05C57
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Reconfiguration of Minimum PSD Forcing Sets and Minimum Skew Forcing Sets
by: Bong, Novi, et al.
Published: (2025)

Zero forcing propagation time intervals and graphs with fixed propagation time
by: Ferrero, Daniela, et al.
Published: (2025)

The Lights Out Game on Directed Graphs
by: Dettling, T. Elise, et al.
Published: (2023)

Throttling for standard zero forcing on directed graphs
by: Cairncross, Emily, et al.
Published: (2020)

A new characterization of the set of Laplacian spectral radii of trees
by: Dong, Fengming, et al.
Published: (2026)

Isolation game on graphs
by: Brešar, Boštjan, et al.
Published: (2024)

The burning number conjecture holds for trees of order $n$ with at most $\left\lfloor \sqrt{n-1}\right\rfloor$ degree-2 vertices
by: Ning, Jiajun, et al.
Published: (2025)

Biased domination games
by: Bagdas, Ali Deniz, et al.
Published: (2024)

Localization game capture time of trees and outerplanar graphs
by: Chenoweth, Vesna Iršič, et al.
Published: (2025)

The capture time in the game of cops and many robbers
by: Gyergyek, Miha, et al.
Published: (2025)

On the minimal forts of trees
by: Cameron, Thomas R., et al.
Published: (2025)

A result on spanning trees with bounded total excess
by: Zhou, Sizhong
Published: (2025)

A note on plane trees with decreasing labels
by: Cheung, Tsun-Ming, et al.
Published: (2025)

Convex combination of first and second eigenvalues of trees
by: Kumar, Hitesh, et al.
Published: (2026)

Maximizing the index of signed complete graphs with spanning trees on $k$ pendant vertices
by: Li, Dan, et al.
Published: (2024)

A spectral condition for spanning trees with restricted degrees in bipartite graphs
by: Wu, Jiancheng, et al.
Published: (2024)

Stotting in positional games
by: Carmesin, Johannes, et al.
Published: (2026)

Spanning k-trees and distance spectral radius in graphs
by: Zhou, Sizhong, et al.
Published: (2023)

Existence of trees with prescribed maximum degrees and spectral radii
by: Dong, Fengming, et al.
Published: (2025)

The Smith normal form of distance matrices of high dimensional trees
by: Alfaro, Carlos A., et al.
Published: (2025)

Creating triangles in Constructor-Blocker games
by: Boisson, Chloé, et al.
Published: (2025)

The domatic number game played on graphs
by: Hartnell, Bert L., et al.
Published: (2025)

Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs
by: Wu, Jiancheng, et al.
Published: (2025)

Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
by: Gao, Yongbin, et al.
Published: (2026)

On Maker-Breaker domination game critical graphs
by: Brešar, Boštjan, et al.
Published: (2025)

An Improved Upper Bound on the Threshold Bias of the Oriented-cycle game
by: Liebenau, Anita, et al.
Published: (2025)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
by: Lin, Jifu, et al.
Published: (2024)

Spectral properties of balanced trees and dendrimers
by: Damnjanović, Ivan, et al.
Published: (2022)

Self-Reachable Chip Configurations on Trees
by: Lyons, Benjamin, et al.
Published: (2024)

Patrolling cop vs omniscient robber
by: Chiarelli, Nina, et al.
Published: (2026)

On the number of minimal forts of a graph
by: Becker, Paul, et al.
Published: (2024)

Exploring structural properties of $k$-trees and block graphs
by: Markenzon, Lilian, et al.
Published: (2023)

Stacking and clearing in graph pebbling
by: Csernák, Tamás, et al.
Published: (2026)

Characterizing tricyclic graphs with pendant vertices having largest $A_α$-spectral radius
by: Basunia, Mainak, et al.
Published: (2026)

Principal minors of tree distance matrices
by: Richman, Harry, et al.
Published: (2024)

Enumeration of plane triangulations with all vertices of degree $3$ or $6$ and a new characterization of akempic triangulations
by: Florek, Jan
Published: (2025)

Effective resistance and spanning trees in complete graphs with distance-class deletions
by: Tamura, Shunya
Published: (2026)

A bound on the girth of quaternion unit gain graphs in terms of the rank
by: Khan, Suliman, et al.
Published: (2024)

Pseudo-orientable ribbon graphs: Matrix--Quasi-tree Theorem and log-concavity
by: Ding, Changxin, et al.
Published: (2026)

A characterization of graphs $G$ with $m_G(λ)= 2c(G) + q_s(G) - 1$
by: Xu, Songnian, et al.
Published: (2024)