Fix d ≥ 2, and let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spread-out’ percolation model studied by Penrose [8], who showed that, as r →∞, the average degree of the corresponding random graph at the percolation threshold tends ...

Given a graph G with weighted edges, and a subset of nodes T , the T -join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A i u 2 T . We describe the applications of the T -join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal re nement of nite element meshes. We suggest a practical algorithm ...

In this paper, we show how to design a perfect simulation for Markovian fork-join networks, or equivalently, free-choice Petri nets. For pure fork-join networks and for event graphs, the simulation time can be greatly reduced by using extremal initial states, namely blocking states, although such nets do not exhibit any natural monotonicity property. Another approach for perfect simulation of p...

Let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spreadout’ percolation model studied by Penrose [6], who showed that, as r → ∞, the average degree of the corresponding random graph at the percolation threshold tends to 1, i.e., the...

In11, Kulli and Janakiram initiate the concept of maximal domination in graphs. In this paper, we obtained some bounds characterizations. Also, estimate value number graph products such as join graphs, corona product, cartesian product strong product.

Let G be a graph with its vertices and edges. On defining bijective function ρ:V(G) →{0,1,...,p}. For each edge assign the label 1 if ρ*(ab)= | ρ(a) 2 −ρ(b) /ρ(a)−ρ(b) is odd or 0 otherwise such that |eρ(1) − eρ(0)| ≤ then labeling called as divided square difference cordial graph. We prove in this paper for relatively possible set of spider graphs atmost one legs greater than namely J(SP(1 m ,...

The quadratic embedding constant (QE constant) of a graph is new characteristic value defined through the distance matrix. We derive formulae for QE constants join two regular graphs, double graphs and certain lexicographic product graphs. Examples include complete bipartite wheel friendship completely split graph, some associated to strongly

Given a graph G with weighted edges, and a subset of nodes T, the T-join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A ii u 2 T. We describe the applications of the T-join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal reenement of nite element meshes. We suggest a practical algorithm for...