#### Filter Results:

#### Publication Year

2007

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Dalibor Froncek, Petr Kovár, Tereza Kovarova, Michael Kubesa
- Discrete Mathematics
- 2010

- Dalibor Froncek, Tereza Kovarova
- Ars Comb.
- 2007

Let G = (V, E) be a graph on n vertices. A bijection f : V → {1, 2,. .. , n} is called a distance magic labeling of G if there exists an integer k such that u∈N (v) f (u) = k for all v ∈ V , where N(v) is the set of all vertices adjacent to v. The constant k is the magic constant of f and any graph which admits a distance magic labeling is a distance magic… (More)

- Dalibor Lukás, Petr Kovár, Tereza Kovarova, Michal Merta
- Numerical Algorithms
- 2015

We propose a method of a parallel distribution of densely populated matrices arising in boundary element discretizations of partial differential equations. In our method the underlying boundary element mesh consisting of n elements is decomposed into N submeshes. The related N×N submatrices are assigned to N concurrent processes to be assembled.… (More)

In this paper, a new parallel acoustic simulation package has been created, using the boundary element method (BEM). The package is built on top of SPECFEM3D, which is parallel software for doing seismic simulations, e.g. earthquake simulations of the globe. The acoustical simulation relies on a Fourier transform of the seismic elastodynamic data, resulting… (More)

A vertex-magic total labeling of a graph G(V, E) is defined as one-to-one mapping from the set of integers {1, 2, ..., |V | + |E|} to V ∪ E with the property that the sum of the label of a vertex and the labels of all edges adjacent to this vertex is the same constant for all vertices of the graph. In this article we present some basic ideas of labelings of… (More)

- ‹
- 1
- ›