Vertex weighted graph
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds
... and vertex weighted graph, where V is the set of vertices, E is the set of edges, and, w(v) is a positive weight asso- ciated with each vertex v ∈ V ...
7
Seeing the results of a mutation with a vertex weighted hierarchical graph
... the vertex weighted hier- archical method is coupled with a predicted change in the 3D ...level graph of the wild type protein and the mutant protein V51R respectively and were generated by Cytoscape ...
8
Minimum Weighted Feedback Vertex Set on Diamonds
... a vertex weighted graph G, a minimum Weighted Feedback Vertex Set (MWFVS) is a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex ...
5
Network Routing Protocol using Genetic Algorithms
... a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree ...source vertex (node) in the graph, ...
5
Vertex Switching in 3-Product Cordial Graphs
... of graph labeling is available in ...A vertex labeling f : V (G) → {−1, 0, 1} is said to be an EP-cordial labeling if it induces the edge labeling f ∗ defined by f ∗ (uv) = f(u)f(v) for each and if |e f (i) ...
9
One Modulo Three Geometric Mean Graphs
... A graph G is said to be one modulo three geometric mean graph if there is an injective function φ from the vertex set of G to the set {a | 1 ≤ a ≤ 3q − 2} and either a ≡ 0(mod3) or a ≡ 1(mod3)} where ...
8
Truncations of Double Vertex Fuzzy Graphs
... In this paper, we have discussed the truncation properties of double vertex fuzzy graphs and complete double vertex fuzzy graphs. Also we have studied the isomorphic property of truncations of double ...
7
The upper connected vertex detour monophonic number of a graph
... connected graph G with monophonic radius r, monophonic diameter d and upper connected x- detour monophonic number k for some vertex x in ...connected graph G of order n with dm x (G) = j, dm + x (G) ...
15
Pure Math 30 Diploma Exam - Transformations.pdf
... The transformed graph is the reciprocal of the original The transformed graph is not a function The transformed graph has the same domain and range as the original graph The vertex of th[r] ...
23
c10c56df03416f7a7c81758fce7a609e3c9efc5b.pdf
... We need a few more definitions. Let P be a simple polygon, with an edge uv where v is a reflex vertex. Extend the directed ray from u through v and let t be the first boundary point of P beyond v that the ray ...
23
A New Technique for Finding Min cut Tree
... dense graph, the probability of choosing wrong pair of nodes is very less due to large number of available pairs among which to choose ...dense graph this algorithm produces surprisingly good ...
7
Further Results on Vertex Odd Divisor Cordial Labeling of Some Graphs
... Graph theory has several interesting applications in system analysis, operations research and economics. Since most of the time the aspects of graph problems are uncertain, it is nice to deal with these ...
8
A Practical Graph Isomorphism Algorithm with Vertex Canonical Labeling
... Two heuristic strategies are applied in the VPFA to shape the search tree of possible mappings. Strategy 1 chooses a vertex in the smallest cell of a partition in each iteration cycle. With this strategy, ...
8
Some properties of the nilradical and non-nilradical graphs over finite commutative ring \(\mathbb{Z}_n\)
... zero-divisor graph was introduced by ...zero-divisor graph given by ...simple graph Γ(R) to R with vertices Z (R) ∗ = Z (R) − { 0 } , the set of ...
10
Detection and tracking of multiple moving objects in video.
... joint probability distribution function. Color was modeled by a 2D Gaussian distribution and texture was modeled by an autobinomial Gibbs Markov random field. [14] demonstrated that the combined color and texture cues ...
68
Neighborhood Contraction in Graphs
... Then the neighborhood contracted graph Gv of G, with respect to the vertex v, is the graph with vertex set V − N v, where two vertices u, w ∈ V − N v are adjacent in Gv such that one of [r] ...
14
Minimal Dominating Functions of Corona Product Graph of a Path with a Cycle
... Graph Theory has been realized as one of the most useful branches of Mathematics or recent origin, finding widest applications in all most all branches of Sciences, Engineering and Computer Science. An ...
7
Topical Coherence for Graph based Extractive Summarization
... McDonald (2007) introduces summarization as an optimization task which takes care of importance, redundancy and coherence simultaneously. In this paper, we also propose a model for single doc- ument summarization which ...
6
R Index of Some Graphs
... a graph G, V(G) and E(G) denote the set of all vertices and edges ...the vertex v is defined as the number of edges incident with v and denoted by ...a vertex v, the sum degree of v is defined as ∑ ( ...
5
Toward autonomous cleaning with manipulator arms
... with graph size, obstacle size and the density of feasible ...covering graph with no more than two traversals of each edge in the spanning tree it ...
88