OFFSET
3,3
COMMENTS
Given a graph G where each vertex is initially considered filled or unfilled, we apply the skew color change rule, which states that a vertex v becomes filled if and only if it is the unique empty neighbor of some other vertex in the graph. The failed skew zero forcing number of G, is the maximum cardinality of any subset S of vertices on which repeated application of the color change rule will not result in all vertices being filled. Note that C^2_n = Ci_n(1,2) is the square of C_n.
LINKS
T. Ansill, B. Jacob, J. Penzellna, and D. Saavedra, Failed skew zero forcing on a graph, Linear Algebra and its Applications, vol. 509 (2016), 40-63.
Index entries for linear recurrences with constant coefficients, signature (1,0,1,-1).
FORMULA
a(n) = 2*floor(n/3) + 2*(ceiling(n/(3*floor(n/3) + 1)) - floor(n/(3*floor(n/3) +1 )) - 1) for n >= 11.
a(n) = 2*A008611(n-3) for n >= 11.
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from Stefano Spezia, Jun 30 2022
STATUS
approved