A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

‎this article presents a systematic study for structure of finite wavelet frames‎ ‎over prime fields‎. ‎let $p$ be a positive prime integer and $mathbb{w}_p$‎ ‎be the finite wavelet group over the prime field $mathbb{z}_p$‎. ‎we study theoretical frame aspects of finite wavelet systems generated by‎ ‎subgroups of the finite wavelet group $mathbb{w}_p$.

let g = (v,e) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. in this paper, we associate a topology to g, called graphic topology of g and we show that it is an alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. then we investigate some properties of this topology. our motivation is to give an e...

29 computation. On the other hand, for network learning, at least 14-16 bits of precision must be used for the weights to avoid having the training process divert too much from the trajectory of the high precision computation. References [1] D. Hammerstrom. A VLSI architecture for high-performance, low cost, on-chip learning. Figure 10: The average squared dierences between the desired and actu...

a result of dixon‎, ‎evans and smith shows that if $g$ is a locally (soluble-by-finite) group whose proper subgroups are (finite rank)-by-abelian‎, ‎then $g$ itself has this property‎, ‎i.e‎. ‎the commutator subgroup of $g$ has finite rank‎. ‎it is proved here that if $g$ is a locally (soluble-by-finite) group whose proper subgroups have minimax commutator subgroup‎, ‎then also the commutator s...

In this paper we investigate the behavior of solutions, stable and unstable of the solutions a second-order rational difference equation. Also we will discuss about the behavior of solutions a the rational system, we show these solutions may be stable or unstable.  

the textit{commutativity degree}, $pr(g)$, of a finite group $g$ (i.e. the probability that two (randomly chosen) elements of $g$ commute with respect to its operation)) has been studied well by many authors. it is well-known that the best upper bound for $pr(g)$ is $frac{5}{8}$ for a finite non--abelian group $g$. in this paper, we will define the same concept for a finite non--abelian textit{...

in this study, the performance of an irreversible regenerative brayton cycle is sought through power maximizations using finite-time thermodynamic concept in finite-size components. optimizations are performed using a genetic algorithm. in order to take into account the finite-time and finite-size concepts in the current problem, a dimensionless mass-flow rate parameter is used to deploy time v...

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...