As applications, we also present some new upper bounds on the Estrada index for general graphs, bipartite graphs, trees and planar graphs, some of which improve the known results obtained by using the algebraic techniques.
Quantified directed graph, of which the nodes represent components and tests and the directed edges represent fault propagation paths, is used to describe fault-test dependency, and quantitative testability information is assigned to nodes and directed edges.
Let be a set-valued mapping, the set be the graph of, which is denoted by for simplicity, This is equivalent to stating that a mapping is any subset of, and.
Therefore, sub-graphs of which boundary proteins are bottleneck proteins have higher chance to be functional modules.
After the closure procedure we obtained 273 (around 5%) non-anchors in the consolidation graph, of which the refinement procedure split 210 and completely resolving 175 of them.
A protein complex can be modelled as an undirected graph of which node is a protein and edge is a physical interaction between two protein nodes.
However, the DO is very complex: revision 26 of the DO contains 11 961 terms in the form of a directed acyclic graph, of which 4399 terms are internal nodes with up to 16 levels of hierarchical structures.
After augmentation, a GOGeneGraph was further transformed into a weighted, undirected graph, of which an edge's length was calculated according to the semantic distance between a pair of GO terms.
In this paper, we present some new upper and lower bounds on LEL and IE of line graph, subdivision graph, para-line graph and total graph of a regular graph, some of which improve previously known results.
3b: 11 graphs each of which has a balanced 3-node graph as its FTC (in a balanced graph, each node has the same number of inputs as outputs, i.e., |u| = 0).
