Some tight bounds on the minimum and maximum forcing numbers of graphs.
Qianqian LiuHeping ZhangPublished in: Discret. Appl. Math. (2023)
Keyphrases
- tight bounds
- upper bound
- graph theory
- spanning tree
- minimum distance
- lower bound
- directed graph
- graph matching
- weighted graph
- real time
- maximum distance
- series parallel
- graph databases
- graph structures
- connected dominating set
- graph theoretical
- object recognition
- information systems
- graph partitioning
- maximum number
- minimum energy
- semi supervised
- neural network
- square error
- data sets