International Journal of Mathematics and Mathematical Sciences

In this paper, we present a sufficient condition for the output reachability of discrete-time positive switched systems. Besides, necessary and sufficient conditions for output monomial reachability and zero output controllability are provided. Further, some examples are shown.

In this paper, we derive a fixed-point theorem for self-mappings. That is, it is shown that every isometric self-mapping on a weakly compact convex subset of a strictly convex Banach space has a fixed point.

In this paper, we discussed the estimation of the index for a 3-Burr-XII distribution based on Progressive Type-II censoring. The maximum likelihood and Bayes method have been used to obtain the estimating of the index . The Fisher information matrix has been used to construct approximate confidence intervals. Also, bootstrap confidence intervals (CIs) of the estimators have been obtained. The Bayesian estimates for the index have been obtained by the Markov Chain Monte Carlo method. Also, the credible intervals are constructed by using MCMC samples. Two real-datasets have been discussed using the proposed index.

A total -labeling is a function from the edge set to first natural number and a function from the vertex set to non negative even number up to , where . A vertex irregular reflexive-labeling of a simple, undirected, and finite graph is total -labeling, if for every two different vertices and of , , where . The minimum for graph which has a vertex irregular reflexive -labeling is called the reflexive vertex strength of the graph , denoted by . In this paper, we determined the exact value of the reflexive vertex strength of any graph with pendant vertex which is useful to analyse the reflexive vertex strength on sunlet graph, helm graph, subdivided star graph, and broom graph.

In this paper, we consider a class of rational functions of degree where is a polynomial of degree and establish some inequalities for rational functions with prescribed poles which generalize and refine the result of I. Qasim and A. Liman.

We present upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity with respect to order and size. All bounds presented in this paper are asymptotically sharp.