Bounds on the connected forcing number of a graph

DOI10.1007/s00373-018-1957-xzbMath1402.05163arXiv1605.02124OpenAlexW2963751491WikidataQ129125742 ScholiaQ129125742MaRDI QIDQ1756082

Colton Magnant, Randy Davila, Michael A. Henning, Ryan Pepper

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

girthconnected dominating setszero forcing numberconnected domination numberzero forcing sets

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (12)

GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ On the total forcing number of a graph ⋮ 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 in claw-free cubic graphs ⋮ Maximum nullity and zero forcing number on graphs with maximum degree at most three ⋮ On extremal graphs for zero forcing number ⋮ Edge Forcing in Butterfly Networks

Cites Work

• Unnamed Item
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• On the graph complement conjecture for minimum rank
• Upper bounds on the \(k\)-forcing number of a graph
• Zero forcing number, constrained matchings and strong structural controllability
• The minimum semidefinite rank of a triangle-free graph
• Girth and treewidth
• Zero forcing sets and bipartite circulants
• Non-separating induced cycles in graphs
• Spanning trees in graphs of minimum degree 4 or 5
• A lower bound on the zero forcing number
• Logic circuits from zero forcing
• A short proof for a lower bound on the zero forcing number
• Zero forcing sets and the minimum rank of graphs
• Power domination in graphs
• Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
• Spanning Trees with Many Leaves
• A Graph Reduction Step Preserving Element-Connectivity and Applications
• The forcing number of graphs with given girth
• Domination in Graphs Applied to Electric Power Networks
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Bounds for the Zero Forcing Number of Graphs with Large Girth
• Dynamic approach to k-forcing

This page was built for publication: Bounds on the connected forcing number of a graph