Upper bounds on the \(k\)-forcing number of a graph

DOI10.1016/j.dam.2014.08.029zbMath1304.05041arXiv1401.6206OpenAlexW2002502274MaRDI QIDQ479006

Ryan Pepper, Yair Caro, Randy Davila, David Amos

Publication date: 5 December 2014

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

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

zbMATH Keywords

ranknullityconnected dominating setszero forcing numberzero forcing set\(k\)-forcing\(k\)-forcing number\(k\)-independence numberconnected domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (46)

On the zero forcing number and spectral radius of graphs ⋮ Computational approaches for zero forcing and related problems ⋮ Fractional zero forcing via three-color forcing games ⋮ Proof of a conjecture on the zero forcing number of a graph ⋮ Extremal values and bounds for the zero forcing number ⋮ k-Forcing number for Cartesian product of some graphs ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ Total forcing sets and zero forcing sets in trees ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ Some properties of the closed global shadow graphs and their zero forcing number ⋮ Immune sets in monotone infection rules. Characterization and complexity ⋮ On tight bounds for the \(k\)-forcing number of a graph ⋮ Some bounds on the zero forcing number of a graph ⋮ UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS ⋮ On graphs maximizing the zero forcing number ⋮ Open global shadow graph and it’s zero forcing number ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ Bounding the total forcing number of graphs ⋮ On a conjecture of Gentner and Rautenbach ⋮ Infection in hypergraphs ⋮ The Zero Forcing Number of Graphs ⋮ From the editor-in-chief ⋮ On the total forcing number of a graph ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities ⋮ The forcing number of graphs with given girth ⋮ Grundy domination and zero forcing in regular graphs ⋮ The relationship between \(k\)-forcing and \(k\)-power domination ⋮ On the nullity of a connected graph in terms of order and maximum degree ⋮ Grundy dominating sequences and zero forcing sets ⋮ Bounds on the connected forcing number of a graph ⋮ Zero forcing propagation time on oriented graphs ⋮ Propagation time for probabilistic zero forcing ⋮ Total forcing versus total domination in cubic graphs ⋮ Unnamed Item ⋮ Complexity and computation of connected zero forcing ⋮ Zero forcing versus domination in cubic graphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Zero forcing number of a graph in terms of the number of pendant vertices ⋮ Matching, path covers, and total forcing sets ⋮ Zero forcing in claw-free cubic graphs ⋮ Zero forcing number of degree splitting graphs and complete degree splitting graphs ⋮ Note on forcing problem of trees ⋮ Unnamed Item ⋮ Maximum nullity and zero forcing number on graphs with maximum degree at most three ⋮ A computational comparison of compact MILP formulations for the zero forcing number ⋮ On extremal graphs for zero forcing number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular independent sets
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Propagation time for zero forcing on a graph
• Zero forcing number, path cover number, and maximum nullity of cacti
• Zero forcing number, constrained matchings and strong structural controllability
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Zero forcing sets and bipartite circulants
• A survey of selected recent results on total domination in graphs
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• New approach to the \(k\)-independence number of a graph
• On \(k\)-domination and \(j\)-independence in graphs
• Zero forcing sets and the minimum rank of graphs
• Power domination in graphs
• Degree Sequence Index Strategy
• Iteration Index of a Zero Forcing Set in a Graph
• Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
• On Zero Forcing Number of Permutation Graphs
• Connected Domination and Spanning Trees with Many Leaves

This page was built for publication: Upper bounds on the \(k\)-forcing number of a graph