Year: 2024
Type: article
Abstract: In this paper, we consider the connected power domination number ([Formula: see text]) of three standard products of graphs. The exact value of the connected power domination number of [Formula: see text] is obtained for any two nontrivial graphs [Formula: see text] and [Formula: see text] Further, tight upper bounds are proved for the connected power domination number of the Cartesian product of two graphs [Formula: see text] and [Formula: see text] Consequently, the exact value of the connected power domination number of the Cartesian product of some standard graphs is determined. Finally, the connected power domination number of the tensor product of graphs is discussed.
Authors: S. Ganesamurthy, R. Srimathi, J. Jeyaranjani
Institution: SRM Institute of Science and Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: University Grants Commission
OpenAlex ID: W4403627004