University of Primorska University Library - all departments (UPUK)
13.
The q-analogue of zero forcing for certain families of graphs
Fallat, Shaun M. ...
Zero forcing is a combinatorial game played on a graph with the ultimate goal of chang- ing the colour of all the vertices at minimal cost. Originally this game was conceived as a one player game, ...but later a two-player version was devised in-conjunction with studies on the inertia of a graph, and has become known as the q-analogue of zero forcing. In this paper, we study and compute the q-analogue zero forcing number for various families of graphs. We begin with by considering a concept of contraction associated with trees. We then significantly generalize an equation between this q-analogue of zero forcing and a corresponding nullity parameter for all threshold graphs. We close by studying the q-analogue of zero forcing for certain Kneser graphs, and a variety of cartesian products of structured graphs.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
