Results 61 to 70 of about 488,070 (310)
On Locating-Dominating Set of Regular Graphs
Journal of Mathematics, 2021 Let G be a simple, connected, and finite graph. For every vertex v∈VG, we denote by NGv the set of neighbours of v in G. The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ VG such that every two distinct vertices u,v∈
Anuwar Kadir Abdul Gafur +1 more
doaj +1 more source
Results on Relatively Prime Domination Number of Vertex Switching of Some Graphs
Ratio Mathematica, 2023 If a set S ⊆ V has at least two members and every pair of vertices u and v is such that (d(u), d(v)) = 1, then it is said to be a relatively prime dominating set.
A Jancy Vini, C Jayasekaran
doaj +1 more source
Dominating sets in plane triangulations
Discrete Mathematics, 2010 In 1996, Matheson and Tarjan conjectured that any n-vertex triangulation with n sufficiently large has a dominating set of size at most n/4. We prove this for graphs of maximum degree 6.
King, Erika L.C., Pelsmajer, Michael J.
openaire +2 more sources
Approximating k-Connected m-Dominating Sets [PDF]
Algorithmica, 2022 A subset $S$ of nodes in a graph $G$ is a $k$-connected $m$-dominating set ($(k,m)$-cds) if the subgraph $G[S]$ induced by $S$ is $k$-connected and every $v \in V \setminus S$ has at least $m$ neighbors in $S$. In the $k$-Connected $m$-Dominating Set ($(k,m)$-CDS) problem the goal is to find a minimum weight $(k,m)$-cds in a node-weighted graph. For $m
openaire +5 more sources
FEBS Letters, EarlyView.Phototrophs evolved light‐harvesting systems adapted for efficient photon capture in habitats enriched in far‐red radiation. A subset of eukaryotic pigment‐binding proteins can absorb far‐red photons via low‐energy chlorophyll states known as red forms.
Antonello Amelii +8 more
wiley +1 more source
Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2018 A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S.
Rad Nader Jafari, Rahbani Hadi
doaj +1 more source
Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. There exist infinite families of graphs that are not TI-graphs. We define the TI-augmentation number \(\operatorname{ti}(
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
Speaker Clustering Using Dominant Sets [PDF]
2018 24th International Conference on Pattern Recognition (ICPR), 2018 Speaker clustering is the task of forming speaker-specific groups based on a set of utterances. In this paper, we address this task by using Dominant Sets (DS). DS is a graphbased clustering algorithm with interesting properties that fits well to our problem and has never been applied before to speaker clustering.
Hibraj, Feliks +3 more
openaire +2 more sources
FEBS Letters, EarlyView.Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining
, 2017 Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLS$_o$) algorithm to solve minimum dominating set problem in large graphs ...
Chalupa, David
core +1 more source