Given a factoring of a graph, the factor domination number gamma-f is the smallest number of nodes which dominate all factors. General results, mainly involving bounds on gamma-f for factoring of arbitrary graphs, are presented, and some of these are generalizations of well known relationships. The special case of two-factoring K(p) into a graph G and its complement GBAR receives special emphasis.
机构:
Slovak Univ Technol Bratislava, Fac Civil Engn, Dept Math, Bratislava, SlovakiaSlovak Univ Technol Bratislava, Fac Civil Engn, Dept Math, Bratislava, Slovakia
Knor, Martin
Skrekovski, Riste
论文数: 0引用数: 0
h-index: 0
机构:
Univ Ljubljana, FMF, Koper, Slovenia
Fac Informat Studies, Novo Mesto, Slovenia
Univ Primorska, FAMNIT, Koper, SloveniaSlovak Univ Technol Bratislava, Fac Civil Engn, Dept Math, Bratislava, Slovakia
Skrekovski, Riste
Tepeh, Aleksandra
论文数: 0引用数: 0
h-index: 0
机构:
Fac Informat Studies, Novo Mesto, Slovenia
Univ Maribor, Fac Elect Engn & Comp Sci, Koroska Cesta 46, SI-2000 Maribor, SloveniaSlovak Univ Technol Bratislava, Fac Civil Engn, Dept Math, Bratislava, Slovakia