Domination in bipartite graphs and in their complements.

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24510%2F03%3A00000025" target="_blank" >RIV/46747885:24510/03:00000025 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Domination in bipartite graphs and in their complements.
Popis výsledku v původním jazyce
The domatic numbers of a graph $G$ and of its complement $bar G$ were studied by J. E. Dunbar, T. W. Haynes and M. A. Henning. They suggested four open problems. We will solve the following ones: Characterize bipartite graphs $G$ having $d(G) = d(bar G)$. Further, we will present a partial solution to the problem: Is it true that if $G$ is a graph satisfying $d(G) = d(bar G)$, then $gamma(G) = gamma(bar G)$? Finally, we prove an existence theorem concerning the total domatic number of a graph andof its complement.
Název v anglickém jazyce
Domination in bipartite graphs and in their complements.
Popis výsledku anglicky
The domatic numbers of a graph $G$ and of its complement $bar G$ were studied by J. E. Dunbar, T. W. Haynes and M. A. Henning. They suggested four open problems. We will solve the following ones: Characterize bipartite graphs $G$ having $d(G) = d(bar G)$. Further, we will present a partial solution to the problem: Is it true that if $G$ is a graph satisfying $d(G) = d(bar G)$, then $gamma(G) = gamma(bar G)$? Finally, we prove an existence theorem concerning the total domatic number of a graph andof its complement.

Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
BA - Obecná matematika
OECD FORD obor
—

Rok uplatnění
2003
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)