Learn More
The connective eccentricity index of a graph G is defined as ξ ce (G) = v∈V (G) d(v) ε(v) , where ε(v) and d(v) denote the eccentricity and the degree of the vertex v, respectively. In this paper we derive upper or lower bounds for the connective eccentricity index in terms of some graph invariants such as the radius, independence number, vertex(More)
The simplest way to perform fuzzy risk assessment is to calculate the fuzzy expected value and convert fuzzy risk into non-fuzzy risk, converting it to a clear number. In doing so, there is a transition from a fuzzy set to clear set. Under such an a level, three risk values can be calculated. As adopts all values throughout the set, it is possible to obtain(More)