On trees and unicyclic graphs with equal forcing-type numbers

DOI10.1007/s40840-022-01276-2zbMath1491.05112OpenAlexW4225933198MaRDI QIDQ2147600

Hui Jiang, Jingshu Zhang, Wen-Jing Li

Publication date: 20 June 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-022-01276-2

zbMATH Keywords

treeunicyclic graphforcing numbertotal forcing numberconnected forcing number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Extremal values and bounds for the zero forcing number
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Zero forcing number, constrained matchings and strong structural controllability
• On the total forcing number of a graph
• Bounds on the connected forcing number of a graph
• Logic circuits from zero forcing
• Total forcing versus total domination in cubic graphs
• Complexity and computation of connected zero forcing
• Total forcing sets and zero forcing sets in trees
• On the zero forcing number of a graph involving some classical parameters
• Zero forcing sets and the minimum rank of graphs
• Power domination in graphs
• A Graph Reduction Step Preserving Element-Connectivity and Applications
• The Zero Forcing Number of Graphs
• Domination in Graphs Applied to Electric Power Networks
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph

This page was built for publication: On trees and unicyclic graphs with equal forcing-type numbers