This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n13http://localhost/temp/predkladatel/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/ontology/domain/vavai/
n9http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F46747885%3A24510%2F05%3A%230000229%21RIV10-MSM-24510___/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F46747885%3A24510%2F05%3A%230000229%21RIV10-MSM-24510___
rdf:type
n5:Vysledek skos:Concept
dcterms:description
Let G be a finite and simple graph with the vertex set V (G), and let f : V (G) -> {-1, 1} be a two-valued function. If Sigma(x is an element of N[nu]) f(x) >= 1 for each nu E V (G), where N[nu] is the closed neighborhood of v, then f is a signed dominating function on G. A set {f(1), f(2),..., f(d)} of signed dominating functions on G with the property that Sigma(i=1)(d) fi (x) <= 1 for each x is an element of V (G), is called a signed dominating family (of functions) on G. The maximum number of functions in a signed dominating family on G is the signed domatic number on G, denoted by d(S) (G). The properties of the signed domatic number d(S) (G) are studied in this paper. In particular, we determine the signed domatic number of complete graphs, cycles, fans, and wheels. Let G be a finite and simple graph with the vertex set V (G), and let f : V (G) -> {-1, 1} be a two-valued function. If Sigma(x is an element of N[nu]) f(x) >= 1 for each nu E V (G), where N[nu] is the closed neighborhood of v, then f is a signed dominating function on G. A set {f(1), f(2),..., f(d)} of signed dominating functions on G with the property that Sigma(i=1)(d) fi (x) <= 1 for each x is an element of V (G), is called a signed dominating family (of functions) on G. The maximum number of functions in a signed dominating family on G is the signed domatic number on G, denoted by d(S) (G). The properties of the signed domatic number d(S) (G) are studied in this paper. In particular, we determine the signed domatic number of complete graphs, cycles, fans, and wheels.
dcterms:title
Signed domatic number of a graph Signed domatic number of a graph
skos:prefLabel
Signed domatic number of a graph Signed domatic number of a graph
skos:notation
RIV/46747885:24510/05:#0000229!RIV10-MSM-24510___
n3:aktivita
n12:Z
n3:aktivity
Z(MSM 245100302)
n3:cisloPeriodika
3
n3:dodaniDat
n6:2010
n3:domaciTvurceVysledku
n8:8073228
n3:druhVysledku
n16:J
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n10:predkladatel
n3:idSjednocenehoVysledku
542590
n3:idVysledku
RIV/46747885:24510/05:#0000229
n3:jazykVysledku
n18:eng
n3:klicovaSlova
signed domatic number; signed dominating function; signed domination number
n3:klicoveSlovo
n4:signed%20domination%20number n4:signed%20domatic%20number n4:signed%20dominating%20function
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[64A0FF2FC286]
n3:nazevZdroje
DISCRETE APPLIED MATHEMATICS
n3:obor
n15:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n6:2005
n3:svazekPeriodika
150
n3:tvurceVysledku
Volkmann, Lutz Zelinka, Bohdan
n3:wos
961VU
n3:zamer
n9:MSM%20245100302
s:issn
0166-218X
s:numberOfPages
7
n13:organizacniJednotka
24510