• Login
    Search 
    •   oURspace Home
    • Faculty of Science
    • Search
    •   oURspace Home
    • Faculty of Science
    • Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-10 of 43

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
    Thumbnail

    Simultaneous Tracking and Activity Recognition with Relational Dynamic Bayesian Networks 

    Manfredotti, Cristina Elena; Fleet, David James; Hamilton, Howard John; Zilles, Sandra (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 ...
    Thumbnail

    Note on Nordhaus-Gaddum problems for Colin de Verdiere type parameters 

    Barrett, Wayne; Fallat, Shaun; Hall, Tracy; Hogben, Leslie (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 ...
    Thumbnail

    Identification of a Pantoea Biosynthetic Cluster That Directs the Synthesis of an Antimicrobial Natural Product 

    Stavrinides, John; Smith, Derek D. N.; Walterson, Alyssa M. (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 ...
    Thumbnail

    On the complexity of the positive semidefinite zero forcing number 

    Meagher, Karen; Fallat, Shaun; Yang, Boting (Elsevier, 2015)
    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 ...
    Thumbnail

    On the relationship between zero forcing number and certain graph coverings 

    Alinaghipour, Fatemeh; Fallat, Shaun; Meagher, Karen (2014)
    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 ...
    Thumbnail

    The maximum nullity of a complete edge subdivision graph is equal to it zero forcing number 

    Barrett, Wayne; Butler, Steve; Catral, Minnie; Hall, Tracy; Fallat, Shaun; Hogben, Leslie; Young, Michael (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 ...
    Thumbnail

    Colin de Verdiere parameters of chordal graphs 

    Mitchell, Lon; Fallat, Shaun (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 ...
    Thumbnail

    On the null space struture associted with trees and cycles 

    Fallat, Shaun; Nasserasr, Shahla (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 ...
    Thumbnail

    Intersecting generalized permutations 

    Borg, Peter; Meagher, Karen (2014-01-21)
    Thumbnail

    Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph 

    Barioli, Francesco; Barrett, Wayne; Fallat, Shaun; Hall, Tracy; Hogben, Leslie; Shader, Bryan; van den Driessche, Pauline; van der Holst, Hein (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 ...
    • 1
    • 2
    • 3
    • 4
    • . . .
    • 5

    Copyright © 2020 University of Regina
    Contact Us | Send Feedback | Archer Library | University of Regina

     

     

    Browse

    All of oURspaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CommunityBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Discover

    AuthorGuo, Chun-Hua (12)Fallat, Shaun (11)Meagher, Karen (9)Lin, Wen-Wei (6)Brigham, R. Mark (5)Hall, Tracy (5)Hogben, Leslie (5)Barrett, Wayne (4)van den Driessche, Pauline (4)Butler, Steve (3)... View MoreSubjectprincipal rank (3)zero forcing (3)clique cover number (2)maximum nullity (2)symmetric matrices (2)Algebraic Riccati equation (1)aridity, bats, crevices, Eptesicus fuscus, hibernacula, microclimate, roost selection, winter (1)Artificial Intelligence (1)bat, body temperature, chiroptera, heterothermy, Pteropodidae, radiotelemetry, torpor (1)bat, cavity, Eptesicus fuscus, pyranometer, roost, Saskatchewan, solar radiation, tree. (1)... View MoreDate Issued2014 (11)2013 (9)2017 (9)2010 (4)2015 (3)2011 (2)2012 (2)2016 (2)2018 (1)Has File(s)Yes (43)

    About

    About oURspacePoliciesLicensesContacts

    Copyright © 2020 University of Regina
    Contact Us | Send Feedback | Archer Library | University of Regina