Ara
Toplam kayıt 2330, listelenen: 161-170
Adaptive methods for solving operator equations by using frames of subspaces
(Işık University Press, 2017)
In this paper, using a frame of subspaces we transform an operator equation to an equivalent `2-problem. Then, we propose an adaptive algorithm to solve the problem and investigate the optimality and complexity properties ...
Partitioning a graph into monopoly sets
(Işık University Press, 2017)
In a graph G = (V, E), a set M ? V (G) is said to be a monopoly set of G if every vertex v ? V ? M has, at least, d(v)/2 neighbors in M. The monopoly size of G, denoted by mo(G), is the minimum cardinality of a monopoly ...
Residual closeness for helm and sunflower graphs
(Işık University Press, 2017-06-06)
Vulnerability is an important concept in network analysis related with the ability of the network to avoid intentional attacks or disruption when a failure is produced in some of its components. Often enough, the network ...
Numerical solution of a 2D- diffusion reaction problem modelling the density of di-vacancies and vacancies in a metal
(Işık University Press, 2017-01-03)
A decomposition solution of a diffusion reaction problem, which models the density of di-vacancies and vacancies in a metal is presented. The results are compared with the numerical solutions. Zero - diffusion solutions ...
Matrix transform of irregular weyl-heisenberg wave packet frames for L² (R)
(Işık University Press, 2017)
Cordoba and Fefferman [4] introduced wave packet systems by applying certain collections of dilations, modulations and translations to the Gaussian function in the study of some classes of singular integral operators. In ...
Graphs cospectral with multicone graphs KW 5 L(P)
(Işık University Press, 2017)
E. R. van Dam and W. H. Haemers [15] conjectured that almost all graphs are determined by their spectra. Nevertheless, the set of graphs which are known to be determined by their spectra is small. Hence, discovering infinite ...
A note on line graphs
(Işık University Press, 2017-02-20)
The line graph and 1-quasitotal graph are well-known concepts in graph theory. In Satyanarayana, Srinivasulu, and Syam Prasad [13], it is proved that if a graph G consists of exactly m connected components Gi (1 ? i ? m) ...
One-dimensional cutting stock problem with divisible items: a case study in steel industry
(Işık University Press, 2019)
This paper considers the one-dimensional cutting stock problem (1D-CSP) with divisible items, which arises in the steel industries. While planning the steel cutting operations, each item can be divided into smaller pieces, ...
Geometric function optimization subject to mixed fuzzy relation inequality constraints
(Işık University Press, 2019)
In this paper, the mixed fuzzy relation geometric programming problem is considered. The Mixed Fuzzy Relation Inequality (MFRI) system is an importance extension of FRI. It is shown that its feasible domain is non-convex ...
Exponential domination of tree related graphs
(Işık University Press, 2019)
The well-known concept of domination in graphs is a good tool for analyzing situations that can be modeled by networks. Although a vertex in the graph can exert influence on, or dominate, all vertices in its immediate ...