Learn More
A simple connected graph G is said to be interval distance monotone if the interval I (u, v) between any pair of vertices u and v in G induces a distance monotone graph. Aïder and Aouchiche [Distance monotonicity and a new characterization of hypercubes, Discrete Math. 245 (2002) 55–62] proposed the following conjecture: a graph G is interval distance(More)
In this paper, we consider the Cauchy problem for the Laplace's equation in a rectangle, where the Cauchy data is given for y = 0 and boundary data are given for x = 0 and x = π. The solution is sought in the interval 0 < y ≤ 1. A modified method is presented and error estimate is obtained. Combining the method of modified, we(More)
  • 1