UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS

DOI10.1017/S000497272300045XMaRDI QIDQ6124016zbMATH OpenOpenAlexFDO

Authors

Publication date 9 April 2024

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s000497272300045x

zbMATH Keywords

NP-completeupper boundextremal graphsemitotal forcing number

Mathematics Subject Classification ID

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

Recommendations

• On the total forcing number of a graph
• On the semitotal forcing number of a graph
• Semitotal bondage numbers of graphs
• Bounding the total forcing number of graphs

Cites work

• A Graph Reduction Step Preserving Element-Connectivity and Applications
• Bounds for the Zero Forcing Number of Graphs with Large Girth
• Dynamic approach to k-forcing
• Extremal values and bounds for the zero forcing number
• On graphs maximizing the zero forcing number
• On the semitotal forcing number of a graph
• On the total forcing number of a graph
• Proof of a conjecture on the zero forcing number of a graph
• Upper bounds on the \(k\)-forcing number of a graph
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS

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