Sentence examples for graph I from inspiring English sources

When we model an opportunistic network using a periodic graph, each node in the static graph, (i in mathcal {V}) represents a person or a sensor node.

In the conflict graph (i), as OBU pairs (A,L) and (M,A) have OBU A in common, their corresponding vertices are connected by an edge in E according to condition 1.

(6) Figure 4 Message (LLR) flow through the i th SCF node in the combined factor graph ( i = 1,…, n ). and the message passed from a PCF node of degree d c on its j th edge to a CBV node is given by m p → v, j ( k ) = 2 tanh - 1 ∏ i ≠ j i = 1 d c tanh m v → p, i ( k ) 2, (7).

Forest: A forest (denoted by F) is an acyclic graph (i.e., a graph without any graph cycles).

We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph).

kern-0pt} n} = n - 1 (3)   10) Forest: A forest (denoted by F) is an acyclic graph (i.e., a graph without any graph cycles).

The spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency matrix) plays an important role in modeling virus propagation in networks.

Start out with an abstract formulation of a periodic graph, i.e., a set of vertices and a set of edges.

To this end, we model the formation problem as a Graph-Constrained Coalition Formation (GCCF) one, where the set of feasible coalitions is restricted by a graph (i.e., the social network).

Throughout this paper we consider simple graphs, i.e., graphs without loops and multiple edges.

Here we employ this method and examine two families of graphs: (i) products of cycles, and (ii) constant-degree expander graphs.