✦ LIBER ✦

Signed star -subdomination numbers in graphs

✍ Scribed by R. Saei; S.M. Sheikholeslami

Book ID: 108112744
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 190 KB
Volume: 156
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.01.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The signed and minus k-subdomination num

The signed and minus k-subdomination numbers of comets

✍ Johannes H. Hattingh; Elna Ungerer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 467 KB

On a Problem Concerningk-Subdomination N

On a Problem Concerningk-Subdomination Numbers of Graphs

✍ Bohdan Zelinka 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 86 KB

Signed star domatic number of a graph

✍ M. Atapour; S.M. Sheikholeslami; A.N. Ghameshlou; L. Volkmann 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 366 KB

Minus totalk-subdomination in graphs

✍ Zhu-rong Duan; Er-fang Shan; Ming-song Li; Wei-guo Wu 📂 Article 📅 2009 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 184 KB

Signed Roman edge domination numbers in

Signed Roman edge domination numbers in graphs

✍ Ahangar, H. Abdollahzadeh; Amjadi, J.; Sheikholeslami, S. M.; Volkmann, L.; Zhao 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 209 KB

Minus k-subdomination in graphs II

✍ Johannes H. Hattingh; Elna Ungerer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 551 KB

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.