Results 111 to 120 of about 14,964 (295)
On the $\delta$-chromatic numbers of the Cartesian products of graphs [PDF]
, 2023 In this work, we study the $\delta$-chromatic number of a graph which is the chromatic number of the $\delta$-complement of a graph. We give a structure of the $\delta$-complements and sharp bounds on the $\delta$-chromatic numbers of the Cartesian ...
Tangjai, Wipawee +2 more
core +1 more source
3D‐Printed Magnetoelectronics for Interactive Appliances and Self‐Aware 4D‐Printed Mechatronics
Advanced Science, EarlyView.3D‐printed magnetoelectronics integrate high‐performance magnetic field sensing directly into complex structural components. Flexible spring and cross‐shaped sensors exhibit giant magnetoimpedance and 3D Hall sensing for vector field reconstruction. Applications include smart‐home switches, robotic joysticks, volumetric magnetometers, and self‐aware 4D‐
Eduardo Sergio Oliveros‐Mata +5 more
wiley +1 more source
AN ALGEBRAIC CHARACTERIZATION OF CARTESIAN PRODUCTS OF FUZZY RELATIONS [PDF]
This paper provides an algebraic characterization of mathematical structures formed by cartesian products of fuzzy relations with sup-min composition.
Furusawa, Hitoshi, 古澤, 仁
core
Dominating Sets of the Cartesian Products of Cycles [PDF]
, 2019 A dominating set for a graph G is a subset D of V(G) such that every vertex not in D is adjacent to at least one member of D. In this project, we first briefly survey a variety of known results on dominating sets of some families of graphs, especially
Assadian, Navid
core +1 more source
Cartesian products as profinite completions [PDF]
, 2006 We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group.
M. Kassabov +3 more
core +1 more source
Quasi perfect codes in the cartesian product of some graphs
Electronic Journal of Graph Theory and ApplicationsAn important question in the study of quasi-perfect codes is whether such codes can be constructed for all possible lengths n. In this paper, we address this question for specific values of n. First, we investigate the existence of quasi-perfect codes in
Smruti Mane, Neeta Shinde
doaj +1 more source
Error-Correcting Codes from k-Resolving Sets
Discussiones Mathematicae Graph Theory, 2019 We demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, and present a decoding algorithm which makes use of covering designs.
Bailey Robert F., Yero Ismael G.
doaj +1 more source
Point-evaluation functionals on algebras of symmetric functions on $(L_\infty)^2$
Karpatsʹkì Matematičnì Publìkacìï, 2019 It is known that every continuous symmetric (invariant under the composition of its argument with each Lebesgue measurable bijection of $[0,1]$ that preserve the Lebesgue measure of measurable sets) polynomial on the Cartesian power of the complex Banach
T.V. Vasylyshyn
doaj +1 more source
All‐Flex Plasma Patch for In Vivo Delivery of Reactive Species
Advanced Science, EarlyView.A fully flexible plasma patch enables stable, conformal treatment on complex biological surfaces and enhances transdermal delivery of reactive species. This platform achieves significant tumor suppression in vivo and reveals coordinated regulation of calcium signaling, metabolism, and programmed cell death, providing a promising strategy for safe and ...
Luxiang Zhao +8 more
wiley +1 more source
Group Embedding into Wreath Products: Cartesian Decomposition Approach [PDF]
, 2023 In this paper, we showed how a group acting regularly and a diagonal group are embedded into the wreath products in there product action using the Cartesian Decomposition.Comment: 9 ...
Momoh, Sunday U. +2 more
core +1 more source