The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...

in this study, we investigate the further properties of quasi irresolute topological groupsdened in [20]. we show that if a group homomorphism f between quasi irresolute topologicalgroups is irresolute at eg, then f is irresolute on g. later we prove that in a semi-connectedquasi irresolute topological group (g; ; ), if v is any symmetric semi-open neighborhood ofeg, then g is generated by v...

Let G be a simple graph with vertex set V and edge set E. The number of vertices of G is called the order, and is denoted by n = n(G). The open neighborhood N(v) = NG(v) of a vertex v consists of all vertices adjacent to v and d(v) = dG(v) = |N(v)| is the degree of v. The closed neighborhood of a vertex v is defined by N [v] = NG [v] = NG (v)∪{v}. By ∆ = ∆(G), we denote the maximum degree of th...

In conventional recognition tasks, models are only trained to recognize learned targets, but it is usually difficult collect training examples of all potential categories. the testing phase, when receive test samples from unknown classes, they mistakenly classify into known classes. Open set (OSR) a more realistic task, which requires classifier detect while keeping high classification accuracy...

A necessary and sufficient condition in terms of lower cut sets are given for the insertion of a $gamma-$continuous function between two comparable real-valued functions.

the concept of an $l$-bornology is introduced and the theory of $l$-bornological spacesis being developed. in particular the lattice of all $l$-bornologies on a given set is studied and basic properties ofthe category of $l$-bornological spaces and bounded mappings are investigated.

the ip3r calcium release channel has been simulated using a stochastic simulation algorithm (ssa;gillespie algorithm) and de young-keiser model. a set of different concentration for cat' and ip3 havebeen used. considering the number of molecules in each state, a non linear behavior of the system can beseen clearly. the inhibiting role of the ca+2 on the open state (x110) has been studied. the d...