The induced path function J(u, v) of a graph consists of the set of all vertices lying on the induced paths between vertices u and v. This function is a special instance of a transit function. The function J satisfies betweenness if w ∈ J(u, v) implies u / ∈ J(w, v) and x ∈ J(u, v) implies J(u, x) ⊆ J(u, v), and it is monotone if x, y ∈ J(u, v) implies J(x, y) ⊆ J(u, v). The induced path functi...

This paper introduces fuzzy belief nets (FBN). The ability to invert arcs between nodes is key to solving belief nets. The inversion is accomplished by defining closeness measures which allow diagnostic reasoning from observed symptoms to cause of failures. The closeness measures are motivated by a Lukasiewicz operator which takes into account the distance from an observed symptom set to the mo...

in the last decade, many applied common studies were done in economic social systems phenomena by using network analysis. in these studies, trade relations can be considered as a network that each vertex represents a country and the trade relations between countries represent links of this network. first, we try to make the world exporting and importing networks based on the existence data for ...

This paper presents a graph-based method for all-word word sense disambiguation of biomedical texts using semantic relatedness as edge weight. Semantic relatedness is derived from a term-topic co-occurrence matrix. The sense inventory is generated by the MetaMap program. Word sense disambiguation is performed on a disambiguation graph via a vertex centrality measure. The proposed method achieve...

let z2 = {0, 1} and g = (v ,e) be a graph. a labeling f : v → z2 induces an edge labeling f* : e →z2 defined by f*(uv) = f(u).f (v). for i ε z2 let vf (i) = v(i) = card{v ε v : f(v) = i} and ef (i) = e(i) = {e ε e : f*(e) = i}. a labeling f is said to be vertex-friendly if | v(0) − v(1) |≤ 1. the vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. in this paper ...

The stress of a vertex is node centrality index, which has been introduced by Shimbel (1953). in graph the number geodesics (shortest paths) passing through it. In this paper, we introduce new topological index for graphs called square root sum using stresses vertices. Further, establish some inequalities, prove results and compute stress-sum standard graphs.

Background. In the current era, Twitter is an increasingly popular tool for dissemination of information as a social media voice. Social valid, but underutilized, education at medical institutions. technologies provide opportunities presentation in alternative and multiple formats to enhance engagement, content creation, motivation individual collaborative learning.
 Objective. This study ...

ABSTRACTIntroduction: Cancer is caused by genetic abnormalities, such as mutation of ontogenesis or tumor suppressor genes which alter downstream signaling pathways and protein-protein interactions. Comparison of protein interactions in cancerous and normal cells can be of help in mechanisms of disease diagnoses and treatments. Methods: We constructed protein interaction networks of cancerous a...

Background: Currently, there is a gap between purely theoretical studies of the topology of large bioregulatory networks and the practical traditions and interests of experimentalists. While the theoretical approaches emphasize the global characterization of regulatory systems, the practical approaches focus on the role of distinct molecules and genes in regulation. To bridge the gap between th...

Abstract Centrality, in some sense, captures the extent to which a vertex controls flow of information network. Here, we propose Local Detour Centrality as novel centrality-based betweenness measure that shortens paths between neighboring vertices compared alternative paths. After presenting our measure, demonstrate empirically it differs from other leading central measures, such betweenness, d...