Results 41 to 50 of about 896 (158)
On $k$-domatic numbers of graphs [PDF]
Czechoslovak Mathematical Journal, 1983 A k-dominating set in the graph G is a subset D of V(G) with the property that for each vertex \(x\in V(G)-D\) there exists a vertex \(y\in D\) such that for the distance between x and y we have \(d(x,y)\leq k.\) A k-domatic partition of G is a partition of V(G) into k-dominating sets in G.
openaire +2 more sources
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 +2 more
core +1 more source
On the fractional total domatic numbers of incidence graphs
Mathematical Modelling and Control, 2023 For a hypergraph $ H $ with vertex set $ X $ and edge set $ Y $, the incidence graph of hypergraph $ H $ is a bipartite graph $ I(H) = (X, Y, E) $, where $ xy\in E $ if and only if $ x\in X $, $ y\in Y $ and $ x\in y $.
Yameng Zhang, Xia Zhang
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
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
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 +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
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 +4 more
wiley +1 more source
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring [PDF]
, 2012 Peer ...
Hasemann, Henning +3 more
core +1 more source