On the signed domination in graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F00%3A00001488" target="_blank" >RIV/00216208:11320/00:00001488 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the signed domination in graphs
Original language description
We prove a tight upper bound on the signed domination number of an n-vertex graph of minimum degree r (conjectured by Furedi and Mubayi).
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2000
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Combinatorica
ISSN
—
e-ISSN
—
Volume of the periodical
20
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
6
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—