Various characterizations of throttling numbers

DOI10.1016/J.DAM.2021.01.002MaRDI QIDQ2656957zbMATH OpenOpenAlexFDO

Authors Joshua Carlson, Jürgen Kritschgau

Publication date 17 March 2021

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.07952

zbMATH Keywords

color change ruleforbidden subgraphsminor monotone floorpositive semidefinitepropagation timethrottlingzero forcing

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Abstract: Zero forcing can be described as a combinatorial game on a graph that uses a color change rule in which vertices change white vertices to blue. The throttling number of a graph minimizes the sum of the number of vertices initially colored blue and the number of time steps required to color the entire graph. Positive semidefinite (PSD) zero forcing is a commonly studied variant of standard zero forcing that alters the color change rule. This paper introduces a method for extending a graph using a PSD zero forcing process. Using this extension method, graphs with PSD throttling number at most $t$ are characterized as specific minors of the Cartesian product of complete graphs and trees. A similar characterization is obtained for the minor monotone floor of PSD zero forcing. Finally, the set of connected graphs on $n$ vertices with throttling number at least $n-k$ is characterized by forbidding a finite family of induced subgraphs. These forbidden subgraphs are constructed for standard throttling.

Recommendations

• Throttling for zero forcing and variants
• Positive semidefinite zero forcing
• Throttling positive semidefinite zero forcing propagation time on graphs
• scientific article; zbMATH DE number 7731182
• Throttling for standard zero forcing on directed graphs

Cites work

• An introduction to the theory of graph spectra
• Multiplicities of eigenvalues and tree-width of graphs
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Positive semidefinite propagation time
• Power domination throttling
• Throttling for the game of cops and robbers on graphs
• Throttling for zero forcing and variants
• Throttling positive semidefinite zero forcing propagation time on graphs
• Throttling zero forcing propagation speed on graphs
• Zero forcing sets and the minimum rank of graphs

Cited in

(6)

• Product throttling
• Throttling processes equivalent to full throttling on trees
• Skew throttling
• Throttling for zero forcing and variants
• Throttling for standard zero forcing on directed graphs
• scientific article; zbMATH DE number 7731182 (Why is no real title available?)

This page was built for publication: Various characterizations of throttling numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656957)