Power domination in certain chemical structures

Journal article

Stephen, Sudeep, Rajan, Bharati, Ryan, Joe, Grigorious, Cyriac and William, Albert. (2015). Power domination in certain chemical structures. Journal of Discrete Algorithms (Amsterdam). 33, pp. 10-18. https://doi.org/10.1016/j.jda.2014.12.003
AuthorsStephen, Sudeep, Rajan, Bharati, Ryan, Joe, Grigorious, Cyriac and William, Albert
Abstract

Let G(V , E) be a simple connected graph. A set S ⊆ V is a power dominating set (PDS) of G, if every vertex and every edge in the system is observed following the observation rules of power system monitoring. The minimum cardinality of a PDS of a graph G is the power domination number ϓp (G). In this paper, we establish a fundamental result that would provide a lower bound for the power domination number of a graph. Further, we solve the power domination problem in polyphenylene dendrimers, Rhenium Trioxide (ReO3) lattices and silicate networks.

KeywordsPower domination ; Polyphenylene dendrimers; ReO 3 lattices; Silicate networks
Year01 Jan 2015
JournalJournal of Discrete Algorithms (Amsterdam)
Journal citation33, pp. 10-18
PublisherAcademic Press (Elsevier)
ISSN1570-8667
Digital Object Identifier (DOI)https://doi.org/10.1016/j.jda.2014.12.003
Web address (URL)https://www.sciencedirect.com/science/article/pii/S1570866714000963?via%3Dihub
Research or scholarlyResearch
Page range10-18
Publisher's version
License
All rights reserved
File Access Level
Controlled
Output statusPublished
Publication dates
Online16 Dec 2014
Print10 Jun 2015
Publication process dates
Deposited21 May 2024
Additional information

©2014 Elsevier B.V. All rights reserved.

Place of publicationNetherlands
Permalink -

https://acuresearchbank.acu.edu.au/item/907qy/power-domination-in-certain-chemical-structures

Log in to edit

Restricted files

Publisher's version

  • 14
    total views
  • 0
    total downloads
  • 7
    views this month
  • 0
    downloads this month
These values are for the period from 19th October 2020, when this repository was created.

Export as

Related outputs

Zero forcing in iterated line digraphs
Ferrero, Daniela, Kalinowski, Thomas and Stephen, Sudeep. (2019). Zero forcing in iterated line digraphs. Discrete Applied Mathematics. 255, pp. 198-208. https://doi.org/10.1016/j.dam.2018.08.019
Minimum rank and zero forcing number for butterfly networks
Ferrero, Daniela, Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe and Stephen, Sudeep. (2019). Minimum rank and zero forcing number for butterfly networks. Journal of Combinatorial Optimization. 37(3), pp. 970-988. https://doi.org/10.1007/s10878-018-0335-1
A lower bound on the zero forcing number
Davila, Randy, Kalinowski, Thomas and Stephen, Sudeep. (2018). A lower bound on the zero forcing number. Discrete Applied Mathematics. 250, pp. 363-367. https://doi.org/10.1016/j.dam.2018.04.015
Average distance in interconnection networks via reduction theorems for vertex-weighted graphs
Klavžar, Sandi, Manuel, Paul, Nadjafi-Arani, M. J., Rajan, R. Sundara, Grigorious, Cyriac and Stephen, Sudeep. (2016). Average distance in interconnection networks via reduction theorems for vertex-weighted graphs. The Computer Journal. 59(12), pp. 1900-1910. https://doi.org/10.1093/comjnl/bxw046
Resolving-power dominating sets
Stephen, Sudeep, Rajan, Bharati, Grigorious, Cyriac and William, Albert. (2015). Resolving-power dominating sets. Applied Mathematics and Computation. 256, pp. 778-785. https://doi.org/10.1016/j.amc.2015.01.037
On the Strong Metric Dimension of Tetrahedral Diamond Lattice
Manuel, Paul, Rajan, Bharati, Grigorious, Cyriac and Stephen, Sudeep. (2015). On the Strong Metric Dimension of Tetrahedral Diamond Lattice. Mathematics in Computer Science. 9(2), pp. 201-208. https://doi.org/10.1007/s11786-015-0226-0
On the metric dimension of circulant and Harary graphs
Grigorious, Cyriac, Manuel, Paul, Miller, Mirka, Rajan, Bharati and Stephen, Sudeep. (2014). On the metric dimension of circulant and Harary graphs. Applied Mathematics and Computation. 248, pp. 47-54. https://doi.org/10.1016/j.amc.2014.09.045
On the partition dimension of a class of circulant graphs
Grigorious, Cyriac, Stephen, Sudeep, Rajan, Bharati, Miller, Mirka and William, Albert. (2014). On the partition dimension of a class of circulant graphs. Information Processing Letters. 114(7), pp. 353-356. https://doi.org/10.1016/j.ipl.2014.02.005