In the calculation of MDEV index, a molecule is regarded as a geometric graph.
The proposed method, LAPSTRUCT, has arisen from the idea of studying the geometry of the intrinsic dependence structure of sample populations, which can be creatively regarded as a weighted graph, together with a metric measuring the degree of relatedness for each pair of individuals.
In the V-W algorithm, the road network can be regarded as an undirected graph G V,E), which is also called as a road network map and is combined with line set E={e1,⋯2,e,e n } and node set V={v1,⋯2,v,v n }.
The network structure of the power system can be regarded as an undirected graph, where is the set of node points representing loads and generators, is the set of edges representing electrical lines, is the set of edge weights and is the set of generator buses.
The alignment results are regarded as an undirected graph where nodes are proteins and links are allowed only among chains that are 40% identical over at least 90% of the alignment length.
In the Bayesian network, the molecular network is regarded as a directed acyclic graph described as follows: (11) P (x 1, x 2, …, x n ) = ∏ i = 1 n P (x i ∣ π i ), where x i denotes node i in the set of variables, that is, the molecules considered, and π i denotes the parent node of x i.
The known metabolites show approximately the same distribution of pair distances as the complete reaction network and can therefore be regarded as a representative subset of the whole graph in this property.
For example, a finite graph can be regarded as a pair (V, E) consisting of a non-empty vertex set V and a symmetric edge relation E on V. The statement that the graph can be properly colored with three colors can be expressed by a second-order sentence: there exist subsets R, G, B that partition V in such a way that two vertices connected by an edge are never the same color.
The theory of transportation networks can be regarded as a chapter of the theory of directed graphs.
It is mentioned in [1] that meeting times of two random walks on some graphs can be regarded as a first hitting time of a single random walk.
