Ara
Toplam kayıt 15, listelenen: 11-15
Some new classes of graceful diameter six trees
(Işık University Press, 2015)
Here we denote a diameter six tree by (a0; a1, a2, . . . , am; b1, b2, . . . , bn; c1, c2, . . . , cr), where a0 is the center of the tree; ai, i = 1, 2, . . . , m, bj , j = 1, 2, . . . , n, and ck, k = 1, 2, . . . , r are ...
Trivially extendable graphs
(Işık University Press, 2015-03-24)
Let G be a simple graph. Let k be a positive integer. G is said to be k-extendable if every independent set of cardinality k is contained in a maximum independent set of G. G is said to be trivially extendable if G is not ...
Computational complexity of domination integrity in graphs
(Işık University Press, 2015)
In a graph G, those dominating sets S which give minimum value for |S| + m(G−S), where m(G−S) denotes the maximum order of a component of G−S, are called dominating integrity sets of G (briefly called DI-sets of G). This ...
Book Review: Oktay Veliyev. Multidimensional Periodic Schrödinger Operator (Perturbation Theory and Applications)
(Işık University Press, 2015)
[No abstract available]
Compressive split-step Fourier method
(Işık University Press, 2015-02-09)
In this paper an approach for decreasing the computational effort required for the split-step Fourier method (SSFM) is introduced. It is shown that using the sparsity property of the simulated signals, the compressive ...