Domination in bipartite graphs and in their complements.

Popis výsledku

—

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.

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ů

Druh výsledku

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

J_x

CEP

BA - Obecná matematika

Rok uplatnění

2003