Zero forcing and power domination for graph products

Thumbnail Image
Date
2018-01-01
Authors
Benson, Katherine
Ferrero, Daniela
Flagg, Mary
Furst, Veronika
Hogben, Leslie
Vasilevska, Violeta
Wissman, Brian
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Person
Hogben, Leslie
Associate Dean
Research Projects
Organizational Units
Organizational Unit
Organizational Unit
Mathematics
Welcome to the exciting world of mathematics at Iowa State University. From cracking codes to modeling the spread of diseases, our program offers something for everyone. With a wide range of courses and research opportunities, you will have the chance to delve deep into the world of mathematics and discover your own unique talents and interests. Whether you dream of working for a top tech company, teaching at a prestigious university, or pursuing cutting-edge research, join us and discover the limitless potential of mathematics at Iowa State University!
Journal Issue
Is Version Of
Versions
Series
Department
Electrical and Computer EngineeringMathematics
Abstract

The power domination number arose from the monitoring of electrical networks, and methods for its determination have the associated application. The zero forcing number arose in the study of maximum nullity among symmetric matrices described by a graph (and also in control of quantum systems and in graph search algorithms). There has been considerable effort devoted to the determination of the power domination number, the zero forcing number, and maximum nullity for specific families of graphs. In this paper we exploit the natural relationship between power domination and zero forcing to obtain results for the power domination number of tensor products and the zero forcing number of lexicographic products of graphs. In addition, we establish a general lower bound for the power domination number of a graph based on the maximum nullity of the matrices described by the graph. We also establish results for the zero forcing number and maximum nullity of tensor products and Cartesian products of certain graphs.

Comments

This article is published as Benson, Katherine F., Daniela Ferrero, Mary Flagg, Veronika Furst, Leslie Hogben, Violeta Vasilevska, and Brian Wissman. "Zero forcing and power domination for graph products." Australasian Journal of Combinatorics 70, no. 2 (2018): 221-235. https://ajc.maths.uq.edu.au/pdf/70/ajc_v70_p221.pdf

Description
Keywords
Citation
DOI
Source
Copyright
Mon Jan 01 00:00:00 UTC 2018
Collections