Edge-disjoint Laman-plus-two graphs
Edge disjoint Hamiltonian cycles in two dimensional torus
... 3. Edge-disjoint Hamiltonian cycles in a 2D torus. When edge-disjoint Hamiltonian cycles are used in a communication algorithm, their effectiveness is improved if more than one cycle ...of ...
10
Finding disjoint paths on edge-colored graphs: more tractability results
... an edge-colored graph (called MaxCDP) has been recently introduced in literature, motivated by applications in social network ...of disjoint paths and the size of the vertex cover of the graph), which makes ...
16
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
... the two endpoints in the newly obtained ...the two constructed disjoint paths and the cycles that do not contain both the endpoints are removed prior to constructing the two disjoint ...
14
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
... the disjoint paths problem with the same time complexity as ...node disjoint paths algorithms based on Maximum-Flow computation such as Ford-Fulkerson and Suur- balle-Tarjan [19], [13] involve a number of ...
14
Disjoint paths in sparse graphs
... exactly two edges of B lying on the outer ...least two neighbors among the vertices in B, we remove two edges adjacent to v , so we have to do it at most d 2 times if d is ...
11
Variation of Graceful Labeling on Disjoint Union of two Subdivided Shell Graphs
... resulting edge labels are also distinct, where an edge incident with vertices u and v is assigned the label |f(u) – ...each edge xy is assigned the label |f(x)−f(y)|, the resulting edge labels ...
7
Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Partition in Augmented Cubes
... Among those proposed interconnection networks, the hyper- cube is a popular interconnection network with many attrac- tive properties such as regularity, symmetry, small diameter, strong connectivity, recursive ...
5
On graphs with few disjoint t-star minors
... last edge on the path from r to v , and let T v and T v ′ be the two component trees arising when e v is deleted from T , where v is in T v ...k disjoint subtrees each with at least t leaves, and we ...
13
Disjoint Paired-Dominating sets in Cubic Graphs
... every edge of A is subdivided with one additional vertex. Now we take an edge-quasi-coloring of A by applying Proposition ...an edge e, the colors of the two new edges are defined to inherit ...
10
In this survey we consider some of the progress made in studying maximal sets of edge-disjoint factors in graphs of various types
... are two quite distinct phases leading to a complete ...with graphs ”! Other times high powered graph theory must be involved, such as Tutte’s f -factor ...
15
The nonsolvability by radicals of generic 3 connected planar Laman graphs
... highlight two very important ideas which run through the proof of the reduction step for edge contractions (Theorem ...to graphs whose constraint equations, both generic and specialised, have finitely ...
35
Links in edge-colored graphs
... blue edge, say zu, between z and A r and if this unique edge zu exists in G c , then there is no red edge zx in G c ...least two blue edges, say zu and zv in G c u, v ∈ A r ...last edge ...
24
Chapter 13. Network Flow III Applications Edge disjoint paths Edge-disjoint paths in a directed graphs
... =⇒ max flow value H is at least k. Proof: Given k such edge disjoint paths, push one unit of flow along each such path. The resulting flow is legal in h and it has value k. Definition 13.1.2 (0/1-flow). A ...
7
Embedding Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles into Twisted Cubes
... of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the ...network. ...
6
Recognizing Planar Laman Graphs
... Our algorithms do not provide any certificate for their correctness. This could be a Henneberg sequence [17] or a decomposition into two acyclic subgraphs [7]. We do not know how to compute either of these faster ...
12
Computing the edge irregularity strengths of chain graphs and the join of two graphs
... science, graphs are used in variety of applications directly or ...labeled graphs have played a vital role in computational linguistics, decision making software tools, coding theory and path determination ...
7
On disjoint union of \(\mathrm{M}\)-graphs
... Sergiy Kozerenko Communicated by V. V. Kirichenko A b s t r a c t . Given a pair (X, σ) consisting of a finite tree X and its vertex self-map σ one can construct the corresponding Markov graph Γ(X, σ) which is a digraph ...
12
Inverse and Disjoint Restrained Domination in Graphs
... two disjoint restrained dominating sets in G. We also consider an invariant the minimum cardinality of the disjoint union of a dominating set and a restrained dominating set. In this paper, we ...
8
Some Topological Indices of Edge Corona of Two Graphs
... V G v v v and edge set E G ( ) = { , e e 1 2 , , e m } . We denote the shortest distance between two vertices u and v in G by d u v ( , ) and the degree of a vertex v in G by d v ( ) . A topological index ...
14
The Degree of an Edge in Union and Join of Two Fuzzy Graphs
... from two given fuzzy graphs using union and ...an edge in fuzzy graphs formed by these operations in terms of the degree of edges in the given fuzzy graphs in some particular ...
12