Now showing items 1-10 of 45
Simultaneous Tracking and Activity Recognition with Relational Dynamic Bayesian Networks
(Department of Computer Science, University of Regina, 2011-03-30)
Taking into account relationships between interacting objects can improve the understanding of the dynamic model governing their behaviors. Moreover, maintaining a belief about the ongoing activity while tracking allows ...
Note on Nordhaus-Gaddum problems for Colin de Verdiere type parameters
(Public Knowledge Network, 2013)
We establish the bounds 4 on the Nordhaus- Gaddum sum upper bound multipliers for all graphs G, in connections with certain Colin de Verdi ere type graph parameters. The Nordhaus-Gaddum sum lower bound is conjectured ...
Identification of a Pantoea Biosynthetic Cluster That Directs the Synthesis of an Antimicrobial Natural Product
(PLOS ONE, 2014-05-15)
Fire Blight is a destructive disease of apple and pear caused by the enteric bacterial pathogen, Erwinia amylovora. E. amylovora initiates infection by colonizing the stigmata of apple and pear trees, and entering the ...
On the complexity of the positive semidefinite zero forcing number
The positive semidefinite zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring and is related to a more conventional version of zero forcing. We establish a relation ...
On the relationship between zero forcing number and certain graph coverings
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced ...
The maximum nullity of a complete edge subdivision graph is equal to it zero forcing number
(International Linear Algebra Society, 2014-06)
Barrett et al. asked in [W. Barrett et al. Minimum rank of edge subdivisions of graphs. Electronic Journal of Linear Algebra, 18:530–563, 2009.], whether the maximum nullity is equal to the zero forcing number for all ...
Colin de Verdiere parameters of chordal graphs
(International Linear Algebra Society, 2013-01)
The Colin de Verdi`ere parameters mu and nu are defined to be the maximum nullity of certain real symmetric matrices associated with a given graph. In this work, both of these parameters are calculated for all chordal ...
On the null space struture associted with trees and cycles
(The Charles Babbage Research Centre, 2013-02)
In this work, we study the structure of the null spaces of matrices associated with graphs. Our primary tool is utilizing Schur complements based on certain collections of independent vertices. This idea is applied in ...
Intersecting generalized permutations
Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph
(Wiley Periodicals, Inc., 2013)
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms and have application to computer science. The zero forcing number is used to study the ...