Campus Units

Mathematics

Document Type

Article

Publication Version

Submitted Manuscript

Publication Date

2013

Journal or Book Title

Linear Algebra and its Applications

Volume

439

First Page

1862

Last Page

1874

DOI

10.1016/j.laa.2013.05.020

Abstract

The positive semidefinite zero forcing number Z+(G) of a graph G was introduced in [4]. We establish a variety of properties of Z+(G): Any vertex of G can be in a minimum positive semidefinite zero forcing set (this is not true for standard zero forcing). The graph parameters tw(G) (tree-width), Z+(G), and Z(G) (standard zero forcing number) all satisfy the Graph Complement Conjecture (see [3]). Graphs having extreme values of the positive semidefinite zero forcing number are characterized. The effect of various graph operations on positive semidefinite zero forcing number and connections with other graph parameters are studied.

Comments

This is a manuscript of an article from Linear Algebra and its Applications 439 (2013): 1862, doi:10.1016/j.laa.2013.05.020. Posted with permission.

Rights

This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/

Copyright Owner

Elsevier Inc.

Language

en

File Format

application/pdf

Published Version

Included in

Algebra Commons

Share

COinS