On trees and unicyclic graphs with equal forcing-type numbers

DOI10.1007/S40840-022-01276-2MaRDI QIDQ2147600zbMATH OpenOpenAlexFDO

Authors Hui Jiang, Wenjing Li, Jingshu Zhang

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

connected forcing numberforcing numbertotal forcing numbertreeunicyclic graph

Mathematics Subject Classification ID

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

Recommendations

• Total forcing sets and zero forcing sets in trees
• Graphs with total forcing number two, revisited
• Note on forcing problem of trees
• On the semitotal forcing number of a graph
• The zero forcing polynomial of a graph

Cites work

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

Cited in

(19)

• The zero forcing polynomial of a graph
• Total forcing and zero forcing in claw-free cubic graphs
• The effect of local majority on global majorityin connected graphs
• Complexity and computation of connected zero forcing
• Note on forcing problem of trees
• On the semitotal forcing number of a graph
• Total forcing sets and zero forcing sets in trees
• Uniform forcing and immune sets in graphs and hypergraphs
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Multi-color forcing in graphs
• scientific article; zbMATH DE number 5717232 (Why is no real title available?)
• Unicyclic graphs with equal domination and complementary tree domination numbers
• Graphs with total forcing number two, revisited
• Edge forcing in butterfly networks
• Matching, path covers, and total forcing sets
• Bounding the total forcing number of graphs
• The zero (total) forcing number and covering number of trees
• Well-forced graphs
• Semitotal forcing in claw-free cubic graphs

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

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