Results 41 to 50 of about 897 (158)

Rainbow domination and related problems on some classes of perfect graphs [PDF]

, 2015
Let $k \in \mathbb{N}$ and let $G$ be a graph. A function $f: V(G) \rightarrow 2^{[k]}$ is a rainbow function if, for every vertex $x$ with $f(x)=\emptyset$, $f(N(x)) =[k]$.
A Bertossi, A Bretscher, B Bres̆ar, B Bres̆ar, B Courcelle, B Hartnell, B Jamison, C Yen, D Corneil, D Corneil, F Chu, G Chang, G Chang, J Rooij van, M Farber, M Golumbic, M Habib, P Cameron, P Gilmore, R Aharoni, R Rubalcaba, R Rubalcaba, T Gallai, V Vizing   +23 more
core   +2 more sources

10211 Abstracts Collection -- Flexible Network Design [PDF]

, 2010
From Monday 24.05.2010---Friday 28.05.2010, the Dagstuhl Seminar 10211 ``Flexible Network Design \u27\u27 was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
, Gupta, Anupam, Leonardi, Stefano, Wattenhofer, Roger   +3 more
core   +1 more source

Neighbourhood total domination in graphs [PDF]

Opuscula Mathematica, 2011
Let \(G = (V,E)\) be a graph without isolated vertices. A dominating set \(S\) of \(G\) is called a neighbourhood total dominating set (ntd-set) if the induced subgraph \(\langle N(S)\rangle\) has no isolated vertices.
S. Arumugam, C. Sivagnanam
doaj   +1 more source

Edge-domatic numbers of cacti [PDF]

Mathematica Bohemica, 1991
In this paper finite undirected graphs without loops and multiple edges are considered. A subset \(D\) of the edge set \(E(G)\) of a graph \(G\) is called dominating, if for each \(e\in E(G)-D\) there exists an edge \(f\in D\) adjacent to \(e\). An edge-domatic partition of \(G\) is a partition of \(E(G)\), all of whose classes are dominating edge sets
openaire   +2 more sources

Meta-Kernelization with Structural Parameters [PDF]

, 2013
Meta-kernelization theorems are general results that provide polynomial kernels for large classes of parameterized problems. The known meta-kernelization theorems, in particular the results of Bodlaender et al. (FOCS'09) and of Fomin et al.
Ganian, Robert, Slivovsky, Friedrich, Szeider, Stefan   +2 more
core   +1 more source

04421 Abstracts Collection -- Algebraic Methods in Computational Complexity [PDF]

, 2005
From 10.10.04 to 15.10.04, the Dagstuhl Seminar 04421 ``Algebraic Methods in Computational Complexity\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their
Buhrman, Harry, Fortnow, Lance, Thierauf, Thomas   +2 more
core   +1 more source

Domatic numbers of lattice graphs [PDF]

Czechoslovak Mathematical Journal, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

The Roman domatic number of a graph

Applied Mathematics Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheikholeslami, S.M., Volkmann, L.
openaire   +1 more source

Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring [PDF]

, 2012
Peer ...
Hasemann, Henning, Hirvonen, Juho, Rybicki, Joel, Suomela, Jukka   +3 more
core   +1 more source

k‐Tuple Total Restrained Domination in Complementary Prisms

International Scholarly Research Notices, Volume 2013, Issue 1, 2013., 2013
In a graph G with δ(G) ≥ k ≥ 1, a k‐tuple total restrained dominating set S is a subset of V(G) such that each vertex of V(G) is adjacent to at least k vertices of S and also each vertex of V(G) − S is adjacent to at least k vertices of V(G) − S. The minimum number of vertices of such sets in G is the k‐tuple total restrained domination number of G. In
Adel P. Kazemi, C. da Fonseca, A. P. Godbole, A. V. Kelarev, B. Wu   +4 more
wiley   +1 more source