Results 11 to 20 of about 4,783,758 (275)
L(1, 2)-labeling numbers on square of cycles
For two positive numbers d and m, an m-L(1, d)-labeling of a graph G is a mapping such that if and if The span of f is the maximum difference among the numbers assigned by f.
Le Liu, Qiong Wu
doaj +1 more source
Dual Directional Structured Products [PDF]
We analyze and value dual directional structured products – or simply dual directionals (DDs) – which have been issued in large amounts since the beginning of 2012. DDs evolved out of another type of structured product called absolute return barrier notes; however, DDs lack principal protection and have different embedded options positions, which are ...
Geng Deng +3 more
openaire +1 more source
Triangular Norm-Based Elements on Bounded Lattices
In this study, we introduce the notion of the T-irreducible element as a generalization of the notion of the meet-irreducible element in complete lattices. We derive some related properties of these elements and T-prime elements.
Şerife Yılmaz, Rabia İşçi
doaj +1 more source
Groupoids: Direct products, semidirect products and solvability
We present some constructions of groupoids such as: direct product, semidirect product and give necessary and sufficient conditions for a groupoid to be embedded into a direct product of groupoids. Also, we establish necessary and sufficient conditions to determine when a semidirect product is direct.
Marín, V., Pinedo, H.
openaire +2 more sources
Principal arc analysis on direct product manifolds [PDF]
We propose a new approach to analyze data that naturally lie on manifolds. We focus on a special class of manifolds, called direct product manifolds, whose intrinsic dimension could be very high.
Foskey, Mark +2 more
core +3 more sources
Solving the dynamic coloring problem for direct products of paths with fan graphs
This paper deals with the r-dynamic chromatic problem of the direct product of a path with a fan graph Fm,n.
Falcón Raúl M. +2 more
doaj +1 more source
A strong direct product theorem for quantum query complexity [PDF]
We show that quantum query complexity satisfies a strong direct product theorem. This means that computing $k$ copies of a function with less than $k$ times the quantum queries needed to compute one copy of the function implies that the overall success ...
Ambainis Andris +13 more
core +1 more source
Super Connected Direct Product of Graphs and Cycles
The topology of an interconnection network can be modeled by a graph G=(V(G),E(G)). The connectivity of graph G is a parameter used to measure the reliability of a corresponding network. The direct product is an important graph product. This paper mainly
Jiaqiong Yin, Yingzhi Tian
doaj +1 more source
Government policymakers face a problem about illustrating and evaluating strategies and plan to design active communities which need to be assessed for studying the collaboration between ministries.
Eman A. AbuHijleh
doaj +1 more source
New Concepts of Picture Fuzzy Graphs with Application
The picture fuzzy set is an efficient mathematical model to deal with uncertain real life problems, in which a intuitionistic fuzzy set may fail to reveal satisfactory results.
Cen Zuo, Anita Pal, Arindam Dey
doaj +1 more source

