Journal
DISCRETE MATHEMATICS
Volume 345, Issue 9, Pages -Publisher
ELSEVIER
DOI: 10.1016/j.disc.2022.112967
Keywords
PSD propagation time; PSD zero forcing; Migration; Nordhaus-Gaddum
Categories
Funding
- National Science Foundation
- NSF [2000037, 1916439]
- Simons Foundation [355645]
- Division Of Mathematical Sciences
- Direct For Mathematical & Physical Scien [2000037, 1916439] Funding Source: National Science Foundation
Ask authors/readers for more resources
The paper establishes the upper bound for the positive semidefinite propagation time of a graph in terms of its positive semidefinite zero forcing number. Two methods and algorithms for transforming one positive semidefinite zero forcing set into another are presented to prove this bound. Consequences of the bound, including a tight Nordhaus-Gaddum sum upper bound on positive semidefinite propagation time, are established.
The tight upper bound pt+(G) < is established for the positive semidefinite propagation time of a graph in terms of its positive semidefinite zero forcing number. To prove this bound, two methods of transforming one positive semidefinite zero forcing set into another and algorithms implementing these methods are presented. Consequences of the bound, including a tight Nordhaus-Gaddum sum upper bound on positive semidefinite propagation time, are established.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
