Journal article
Upper bounds for positive semidefinite propagation time
Discrete mathematics, v 345(9), 112967
Sep 2022
Abstract
The tight upper bound pt+(G)≤⌈|V(G)|−Z+(G)2⌉ 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
5 Record Views
1 citations in Scopus
Details
- Title
- Upper bounds for positive semidefinite propagation time
- Creators
- Leslie Hogben - American Institute of MathematicsMark Hunnell - Winston-Salem State UniversityKevin Liu - University of WashingtonHouston Schuerger - Trinity CollegeBen Small - University Place, WA 98466, United States of AmericaYaqi Zhang - Department of Mathematics, Drexel University, Philadelphia, PA 19104, United States of America
- Publication Details
- Discrete mathematics, v 345(9), 112967
- Publisher
- Elsevier B.V
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Mathematics
- Web of Science ID
- WOS:000806503700004
- Scopus ID
- 2-s2.0-85129738019
- Other Identifier
- 991021861167504721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Mathematics