Abstract We provide a new upper bound for sampling numbers $$(g_n)_{n\in \mathbb {N}}$$ ( g n ) ? N associated with the compact embedding of separable reproducing kernel Hilbert s...

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.

a famous theorem of schur states that for a group $g$ finiteness of $g/z(g)$‎ ‎implies the finiteness of $g'.$ the converse of schur's theorem is an interesting problem which has been considered by some‎ ‎authors‎. ‎recently‎, ‎podoski and szegedy proved the truth of the converse of schur's theorem for capable groups‎. ‎they also established an explicit bound for the index of the...

‎The objective of this paper is to obtain an upper bound to the second Hankel determinant $|a_{2}a_{4}-a_{3}^{2}|$‎ ‎for the function $f$‎, ‎belonging to the class of Gamma-starlike functions‎, ‎using Toeplitz determinants‎. ‎The result presented here include‎ ‎two known results as their special cases‎.  

‎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...