In this paper, we introduce a new class of generalized strongly set-valued nonlinear complementarity problems and construct new iterative algorithms. We show the existence of solutions for this kind of nonlinear complementarity problems and the convergence of iterative sequences generated by the algorithm. Our results extend some recent results in this field.

We explore twoor three-class association schemes. We study aspects of the structure of the relation graphs in association schemes which are not easily revealed by their parameters and spectra. The purpose is to develop some combinatorial methods to characterize the graphs and classify the association schemes, and also to delve deeply into several specific classification problems. We work with s...

In this paper, we introduce the concept of strongly binary g^⋆-closed sets in topological space and investigate group structure set all

We prove two results for directed strongly regular graphs that have an eigenvalue of multiplicity less than k, the common out-degree of each vertex. The first bounds the size of an independent set, and the second determines an eigenvalue of the subgraph on the out-neighborhood of a vertex. Both lead to new nonexistence results for parameter sets.

A computational verb set (verb set for short) consists of a computational verb and a crisp set or a fuzzy set. Verb sets generalize the other sets from linguistic structure “BE+statement” to “verb+statement”. Verb sets are strongly connected to computational verbs and their contexts. In this paper, the framework of verb sets and some basic concepts and properties of verb sets are given. An appl...

in this paper, we prove some coupled coincidence point theorems for mappings satisfying generalized contractive conditions under a new invariant set in ordered cone metric spaces. in fact, we obtain sufficient conditions for existence of coupled coincidence points in the setting of cone metric spaces. some examples are provided to verify the effectiveness and applicability of our results.