Minus k-subdomination in graphs II

✍ Scribed by Johannes H. Hattingh; Elna Ungerer

• Book ID: 104113626
• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 551 KB
• Volume: 171
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/s0012-365x(96)00003-9

✦ Synopsis

Let G = (V,E) be a graph and k E Z + such that 1 ~<

The

k-subdomination number to {-1,0, 1} of a graph G, denoted by 7~l°l(G), equals the minimum weight of a kSF of G. In this paper we give a sharp lower bound for 7~ l°~ for trees and calculate 7~ ~°1 for an arbitrary cycle.