Results 221 to 230 of about 41,065 (264)

In-fiber composite nanostructures formed through filamentation instability during the thermal drawing process. [PDF]

RSC Adv
Li P, Deng H, Xia W, Meng Q, Yi W, Ben Y, Xu B.   +6 more
europepmc   +1 more source

Logic-based Approach and Visualization for the Nuclear Medicine Rescheduling Problem. [PDF]

J Med Syst
Marte C, Mochi M, Dodaro C, Galatà G, Maratea M.   +4 more
europepmc   +1 more source

Domination and power domination in a one-pentagonal carbon nanocone structure. [PDF]

Front Chem
Pandian S, N M.
europepmc   +1 more source

Association and dissociation of Na⁺ between bulk, cluster and micelle sites in aqueous sodium decanoate solutions elucidated by ²³Na NMR relaxation experiments and quadrupolar relaxation modelling.

Soft Matter
Håkansson P, Delgado PM, Selent A, Ghanghas R, Ainasoja I, Komulainen S, Mareš J, Lantto P, Prisle NL, Telkki VV.   +9 more
europepmc   +1 more source

Total Dominating Sets in Maximal Outerplanar Graphs [PDF]

Graphs and Combinatorics, 2017
A set \(D\subseteq V(G)\) is a total domination set of graph \(G\) if every vertex from \(V(G)\) has a neighbor in \(D\). The minimum cardinality of a total domination set of \(G\) is called total domination number and is denoted by \(\gamma_t(G)\). A recent result from \textit{M. Dorfling} et al. [Discrete Math. 339, No.
Lemańska, Magdalena, Zuazua, Rita, Żyliński, Paweł   +2 more
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

INTERIOR TOTAL DOMINATING SETS IN GRAPHS

Advances and Applications in Discrete Mathematics, 2018
Summary: Let \(G = (V(G)\), \(E(G))\) be a simple graph. A total dominating set \(D\) of \(V(G)\) is an interior total dominating set of \(G\) if every \(v\in D\) is an interior vertex of \(G\). The minimum cardinality of an interior total dominating set of \(G\), denoted by \(\gamma_{lt}(G)\) is called an interior total domination number of \(G\).
Pacardo, Shiela Mae B., Rara, Helen M.
openaire   +1 more source

Graphs with few total dominating sets

Discrete Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcin Krzywkowski, Stephan Wagner
openaire   +1 more source

Total Dominating Set Games

2005
In this paper, we consider cooperative games arising from total domination problem on graphs. We introduce two games, rigid total dominating set game and relaxed total dominating set game, and focus on their cores. First, a common necessary and sufficient condition for the balancedness of the two total dominating set games is obtained.
Qizhi Fang, Hye Kyung Kim, Dae Sik Lee
openaire   +1 more source

A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets

Quaestiones Mathematicae, 2009
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a total dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set. In this paper, we provide a constructive characterization of graphs whose vertex set can be partitioned into a ...
Henning, Michael A, Southey, Justin
openaire   +2 more sources

Connected Total Dominating Sets and Connected Total Domination Polynomials of Square of Paths

International Journal of Mathematics Trends and Technology, 2014
Let G be a simple connected graph of order n. Let Dct(G, i) be the family of connected total dominating sets in G with cardinality i. The polynomial Dct (G, x) = n i (G) ct    dct (G, i) x is called the connected total domination polynomial of G. In this paper, we obtain a recursive formula for dct ( 2 n P , i).
A Vijayan, T. Anitha Baby
openaire   +1 more source