According to the qualitative safety evaluation index system of electric power communication network, it is easy to occur in the scoring problems, we put forward a kind of expert evaluation data by correlation degree, solve the problem of qualitative index difference. The method based on Relative Grey Relational Analysis on safety evaluation data, the establishment of expert evaluation of the re...

Survivability has been one of the active fields in network security recently. In order to evaluate the survivability of networked system effectively, this paper proposes a method of combining grey correlation analysis and improved TOPSIS for quantitative assessment. Firstly, it normalizes indicator matrix according to improved TOPSIS method and determines the positive and negative ideal solutio...

In this study, the concept of relative membership degree is proposed to investigate grey optimal cluster evaluation. Besides, the correlation coefficient between sample observation value and standard eigenvalue is used to reflect the similarity degree of evaluation objective and each cluster centre. Based on those mentioned above and concept of relative membership degree, an optimized grey clus...

This paper proposes a grey interval relation TOPSIS for the decision making in which all of the attribute weights and attribute values are given by the interval grey numbers. The feature of our method different from other grey relation decision-making is that all of the subjective and objective weights are obtained by interval grey number and that decisionmaking is performed based on the relati...

let $k$ be a positive integer. a subset $s$ of $v(g)$ in a graph $g$ is a $k$-tuple total dominating set of $g$ if every vertex of $g$ has at least $k$ neighbors in $s$. the $k$-tuple total domination number $gamma _{times k,t}(g)$ of $g$ is the minimum cardinality of a $k$-tuple total dominating set of $g$. if$v(g)=v^{0}={v_{1}^{0},v_{2}^{0},ldots ,v_{n}^{0}}$ and $e(g)=e_{0}$, then for any in...

In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any graph G, ×k(G) ln( − k + 2)+ ln(∑k−1 m=1(k −m)d̂m + )+ 1 − k + 2 n, where ×k(G) is the k-tuple domination number; is the minimal degree; d̂m is the m-degree of G; = 1 if k = 1 or 2 and =−d if k 3; d is the average degree...

We discuss the relevance of information contained in cross correlations among different degrees of freedom, which is crucial in nonequilibrium systems. In particular we consider a stochastic system where two degrees of freedom X{1} and X{2}-in contact with two different thermostats-are coupled together. The production of entropy and the violation of equilibrium fluctuation-dissipation theorem (...

The n-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree dG...