The nullity of a graph G is the multiplicity zero as an eigenvalue its adjacency matrix. An assignment weights to vertices graph, that satisfies sum condition over neighbors each vertex, and uses maximum number independent variables denoted by high weighting graph. This applicable tool used determine Two types graphs are defined, change their nullities studied, namely, G+ab constructed from add...

This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression for the so-called Perron-Frobenius eig...

In terms of damping low frequency oscillation, power system stabilizer(PSS) plays a very key role. However, in terms of PSS capability exploitation, it is quite important to select the suitable parameters assignment. Different from traditional optimization algorithms with eigenvalue analysis based and with system damping ratio as the aim function, in this paper a new PSS parameters method based...

This paper presents an analytical model for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression for the so-called Perron-Frobenius eigenvalu...

This paper models and analyzes downlink and uplink power assignment in code division multiple access (CDMA) mobile networks. By discretizing the area into small segments, the power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression of the so-called Perron–Frobenius eigenvalue of that matrix, wh...

The quadratic assignment problem (QAP) belongs to the class of NP -hard combinatorial optimization problems. Although it has been studied extensively over the past 35 years, problems of size n 15 still prove to be intractable. Since good lower bounds are necessary to solve larger problem instances, we discuss the class of eigenvalue bounds for QAP and extend previous results of these continuous...

This paper models and analyzes downlink and uplink power assignment in Code Division Multiple Access (CDMA) mobile networks. By discretizing the area into small segments, the power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression of the so-called Perron-Frobenius eigenvalue of that matrix, wh...