✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
Furthermore we provide a characterization of trees T with γ t ve(T) = γ t (T).
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this paper we obtain an improved upper bound of total vertex edgedomination number of a tree.
📊
Key Findings & Data:If T is a connected tree with order n, then γ t ve(T) ≤ m 3 with m = 6d n 6 e and we characterize the trees attaining this upper bound.
💡
Conclusion & Impact:Furthermore we provide a characterization of trees T with γ t ve(T) = γ t (T).
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
Ö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 ve(T) ≤ m 3 with m = 6d n 6 e and we characterize the trees attaining this upper bound. Furthermore we provide a characterization of trees T with γ t ve(T) = γ t (T).
🔖
Cite This Article
ŞAHİN, B., ŞAHİN, A. (2019). ON TOTAL VERTEX-EDGE DOMINATION. TWMS (Turkic World Mathematical Society) Journal of Applied and Engineering Mathematics, Cilt: 9 - Sayı: 1, 128–133. https://ajindex.com/articles/341358