Die Zerlegung von gitterpunktförmigen 2-fachen Einheitskreispackungen in drei Einheitskreispackungen
Die Zusammenhangsstruktur symmetrischer Graphen.
Difference labelling of cacti
A graph G is a difference graph iff there exists S ⊂ IN⁺ such that G is isomorphic to the graph DG(S) = (V,E), where V = S and E = i,j:i,j ∈ V ∧ |i-j| ∈ V. It is known that trees, cycles, complete graphs, the complete bipartite graphs and , pyramids and n-sided prisms (n ≥ 4) are difference graphs (cf. [4]). Giving a special labelling algorithm, we prove that cacti with a girth of at least 6 are difference graphs, too.
Difference labelling of digraphs
A digraph G is a difference digraph iff there exists an S ⊂ N⁺ such that G is isomorphic to the digraph DD(S) = (V,A), where V = S and A = {(i,j):i,j ∈ V ∧ i-j ∈ V}.For some classes of digraphs, e.g. alternating trees, oriented cycles, tournaments etc., it is known, under which conditions these digraphs are difference digraphs (cf. [5]). We generalize the so-called source-join (a construction principle to obtain a new difference digraph from two given ones (cf. [5])) and construct a difference labelling...
Difference metrics for interactive orthogonal graph drawing algorithms.
Difference sets and polynomials of prime variables
Different types of products and subdirectly irreducible
Differential equation approximations for Markov chains.
Differential equations associated with generalized Bell polynomials and their zeros
In this paper, we study differential equations arising from the generating functions of the generalized Bell polynomials.We give explicit identities for the generalized Bell polynomials. Finally, we investigate the zeros of the generalized Bell polynomials by using numerical simulations.
Differential equations forp,q-Touchard polynomials
In this paper, we present differential equation for the generating function of the p, q-Touchard polynomials. An application to ordered partitions of a set is investigated.
Differential estimate for -ary forms on closed orthants.
Differenzmengen und zweifach transitive Permutationsgruppen von Primzahlgrad.
Digital search trees and chaos game representation*
In this paper, we consider a possible representation of a DNA sequence in a quaternary tree, in which one can visualize repetitions of subwords (seen as suffixes of subsequences). The CGR-tree turns a sequence of letters into a Digital Search Tree (DST), obtained from the suffixes of the reversed sequence. Several results are known concerning the height, the insertion depth for DST built from independent successive random sequences having the same distribution. Here the successive inserted words...
Digraphs are 2-weight choosable.
Digraphs Associated With Finite Rings
Digraphs contractible onto
We show that any digraph on vertices and with not less than arcs is contractible onto .
Digraphs maximal with respect to arc connectivity
Digraphs maximal with respect to connectivity
Digraphs with isomorphic underlying and domination graphs: connected
The domination graph of a directed graph has an edge between vertices x and y provided either (x,z) or (y,z) is an arc for every vertex z distinct from x and y. We consider directed graphs D for which the domination graph of D is isomorphic to the underlying graph of D. We demonstrate that the complement of the underlying graph must have k connected components isomorphic to complete graphs, paths, or cycles. A complete characterization of directed graphs where k = 1 is presented.
Digraphs with large exponent.