Signed domatic number of a graph

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24510%2F05%3A%230000229" target="_blank" >RIV/46747885:24510/05:#0000229 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Signed domatic number of a graph
Original language 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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)