Journal article
Upper bounds for positive semidefinite propagation time
DISCRETE MATHEMATICS, v 345(9), 112967
Sep 2022
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
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.
Metrics
4 Record Views
1 citations in Scopus
Details
- Title
- Upper bounds for positive semidefinite propagation time
- Publication Details
- DISCRETE MATHEMATICS, v 345(9), 112967
- Publisher
- ELSEVIER; AMSTERDAM
- Grant note
- The authors thank the referees for their work and their helpful comments. This research began at the American Mathematical Society Mathematics Research Community Finding Needles in Haystacks: Approaches to Inverse Problems using Combinatorics and Linear Algebra with support from the National Science Foundation, and the authors thank AMS and NSF. The research of all the authors was partially supported by NSF grant 1916439. The research of Yaqi Zhang was also partially supported by Simons Foundation grant 355645 and NSF grant 2000037.
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Drexel University
- Web of Science ID
- WOS:000806503700004
- Scopus ID
- 2-s2.0-85129738019
- Other Identifier
- 991021861167504721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Mathematics