Power domination in certain chemical structures

Title: Power domination in certain chemical structures
Creator: Stephen, Sudeep; Rajan, Bharati; Ryan, Joe; Grigorious, Cyriac; William, Albert
Relation: Journal of Discrete Algorithms Vol. 33, Issue July 2015, p. 10-18
Publisher Link: http://dx.doi.org/10.1016/j.jda.2014.12.003
Publisher: Elsevier
Resource Type: journal article
Date: 2015
Description: 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.
Subject: power domination; polyphenylene dendrimers; ReO₃ lattices; silicate networks
Identifier: http://hdl.handle.net/1959.13/1336490
Identifier: uon:27629
Identifier: ISSN:1570-8667
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format