منابع مشابه
An Upper Bound of the Minimal Dispersion via Delta Covers
For a point set of n elements in the d-dimensional unit cube and a class of test sets we are interested in the largest volume of a test set which does not contain any point. For all natural numbers n, d and under the assumption of a δ -cover with cardinality |Γδ | we prove that there is a point set, such that the largest volume of such a test set without any point is bounded by log |Γδ | n + δ ...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملan upper bound on the first zagreb index in trees
in this paper we give sharp upper bounds on the zagreb indices and characterize all trees achieving equality in these bounds. also, we give lower bound on first zagreb coindex of trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2018
ISSN: 0885-064X
DOI: 10.1016/j.jco.2017.11.003