Upper bounds for positive semidefinite propagation time

From MaRDI portal
Publication:2144516

DOI10.1016/J.DISC.2022.112967zbMATH Open1491.05081arXiv2111.12240OpenAlexW3214820322MaRDI QIDQ2144516FDOQ2144516


Authors: Leslie Hogben, Mark Hunnell, Houston Schuerger, Ben Small, Kevin F. R. Liu, Yaqi Zhang Edit this on Wikidata


Publication date: 14 June 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: The tight upper bound operatornamept+(G)leqleftlceilfracleftvertoperatornameV(G)ightvertoperatornameZ+(G)2ightceil 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.


Full work available at URL: https://arxiv.org/abs/2111.12240




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Upper bounds for positive semidefinite propagation time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144516)