Line graphs: Their maximum nullities and zero forcing numbers

Title:

Line graphs: Their maximum nullities and zero forcing numbers

Creator:

Fallat, Shaun and Soltani, Abolghasem

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:7ec0eafc-967e-4d33-93fe-b8f9b3ff76ce
uuid:7ec0eafc-967e-4d33-93fe-b8f9b3ff76ce
issn:0011-4642

Subject:

matematika, mathematics, maximum nullity, zero forcing number, positive zero forcing number, line graphsmatrix, tree, positive semidefinite matrix, unicyclic graph, 13, and 51

Type:

model:article and TEXT

Format:

print, bez média, and svazek

Description:

The maximum nullity over a collection of matrices associated with a graph has been attracting the attention of numerous researchers for at least three decades. Along these lines various zero forcing parameters have been devised and utilized for bounding the maximum nullity. The maximum nullity and zero forcing number, and their positive counterparts, for general families of line graphs associated with graphs possessing a variety of specific properties are analysed. Building upon earlier work, where connections to the minimum rank of line graphs were established, we verify analogous equations in the positive semidefinite cases and coincidences with the corresponding zero forcing numbers. Working beyond the case of trees, we study the zero forcing number of line graphs associated with certain families of unicyclic graphs., Shaun Fallat, Abolghasem Soltani., and Obsahuje seznam literatury

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

743-755

Source:

Czechoslovak Mathematical Journal | 2016 Volume:66 | Number:3

Harvested from:

CDK

Metadata only:

false