The fixed set search applied to the power dominating set problem
R Jovanovic, S Voss - Expert Systems, 2020 - Wiley Online Library
In this article, we focus on solving the power dominating set problem and its connected
version. These problems are frequently used for finding optimal placements of phasor …
version. These problems are frequently used for finding optimal placements of phasor …
Metric-locating-dominating sets of graphs for constructing related subsets of vertices
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph
is uniquely distinguished by its distances from the elements of S, and the minimum …
is uniquely distinguished by its distances from the elements of S, and the minimum …
Power domination and resolving power domination of fractal cubic network
S Prabhu, AK Arulmozhi, MA Henning… - ar**ement_Resolution_and_Complex_Key_Generation/links/6345b3509cb4fe44f31d94ba/Enhancing-Cloud-Security-Using-Secured-Binary-DNA-Approach-with-Im**ement-Resolution-and-Complex-Key-Generation.pdf#page=366" data-clk="hl=ko&sa=T&oi=gga&ct=gga&cd=6&d=3498764311165708066&ei=p8-wZ4WOHJ-_6rQPoa3DoAo" data-clk-atid="IqfYj5objjAJ" target="_blank">[PDF] researchgate.net
On total domination number of hypercube and enhanced hypercube networks
Abstract A set D⊆ V (G) is named a dominating set if each element in V (G)\D is connected
to some element belongs to D. Further S is a total dominating set (TDS) of G if for every …
to some element belongs to D. Further S is a total dominating set (TDS) of G if for every …
[PDF][PDF] Zero Forcing and Power Domination in Graphs
S Stephen - 2017 - nova.newcastle.edu.au
Many real world situations can conveniently be described by means of a diagram consisting
of a set of points (nodes) together with lines (edges) joining certain pairs of these points …
of a set of points (nodes) together with lines (edges) joining certain pairs of these points …
New results on metric-locating-dominating sets of graphs
A dominating set $ S $ of a graph is a metric-locating-dominating set if each vertex of the
graph is uniquely distinguished by its distances from the elements of $ S $, and the minimum …
graph is uniquely distinguished by its distances from the elements of $ S $, and the minimum …
[PDF][PDF] RESOLVABILITY OF GRAPHS
C GRIGORIOUS - 2017 - nova.newcastle.edu.au
Graph theory is an established modelling method used in a variety of disciplines to describe
relationships between objects. A graph consists of a finite set of vertices (points, nodes), a …
relationships between objects. A graph consists of a finite set of vertices (points, nodes), a …