On total vertex-edge domination
Künye
Şahin, B. & Şahin, A. (2019). On total vertex-edge domination. TWMS Journal Of Applied And Engineering Mathematics, 9(1), 128-133.Özet
In this paper we obtain an improved upper bound of total vertex edgedomination number of a tree. If T is a connected tree with order n, then ????(T) ? m/3 with m = 6[ n/6] and we characterize the trees attaining this upper bound. Furthermore we provide a characterization of trees T with ????(T) = ?? (T).
Cilt
9Sayı
1SI
Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2700http://jaem.isikun.edu.tr/web/index.php/archive/100-vol9no1/386
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Total roman domination number of graphs
Thakkar, Dineshbhai; Badiyani, Sanket (Işık University Press, 2022)In this paper a characterization of minimal total roman dominating functions has been proved. It has also been proved that if v is a pendant vertex and its neighbor u is not a pendant vertex then f(v) = 0 or 1 for any ... -
Secure point set domination in graphs
Gupta, Purnima; Goyal, Alka (Işık University Press, 2024-04)In this paper, we introduce the notion of secure point-set domination in graphs. A point-set dominating D of graph G is called a secure point-set dominating set if for every vertex u ? V ?D, there exists a vertex v ? D?N(u) ... -
Global color class domination partition of a graph
Swaminathan, Venkatasubramanian; Praba, Venkatrengan (Işık University Press, 2019)Color class domination partition was suggested by E. Sampathkumar and it was studied in [1]. A proper color partition of a finite, simple graph G is called a color class domination partition (or cd-partition) if every color ...