UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS

DOI10.1017/S000497272300045XOpenAlexW4381140806MaRDI QIDQ6124016FDOQ6124016

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

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

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)

Cites Work

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

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)