Results 101 to 110 of about 2,865,652 (295)
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
The fault-diameter of Cartesian products
Advances in Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iztok Banic, Janez Zerovnik
openaire +4 more sources
Polarization Engineering in Vinylene‐Linked COFs Toward Efficient Neuromorphic Computing
Advanced Science, EarlyView.A vinyl‐linked covalent organic framework (COF‐DIBPY) was synthesized on a conductive substrate for memristor applications. Redox reactions and bromide migration enable low‐voltage (0.5V) conductance switching with high analog on/off ratio (15.7). The device was further integrated into a speech emotion recognition system for acoustic simulation and ...
Hao Wang +5 more
wiley +1 more source
On the connectivity of Cartesian product of graphs
Ars Mathematica Contemporanea, 2013 We give a new alternative proof of Liouville’s formula which states that for any graphs G and H on at least two vertices, κ ( G □ H ) = min{ κ ( G )| H |, | G | κ ( H ), δ ( G ) + δ ( H )} , where κ and δ denote the connectivity number and minimum degree of a given graph, respectively.
Jelena Govorcin, Riste Skrekovski
openaire +2 more sources
Domination Numbers in Cartesian Products of Graphs
The domination number of graphs represents the minimum cardinality of a dominating set, a fundamental concept in graph theory with applications in network design, facility location, and computational complexity.
Kiran V Nath
core +1 more source
A characterization of well-dominated Cartesian products [PDF]
, 2023 A graph is well-dominated if all its minimal dominating sets have the same cardinality. In this paper we prove that at least one factor of every connected, well-dominated Cartesian product is a complete graph, which then allows us to give a complete ...
Kuenzel, Kirsti, Rall, Douglas F.
core
Advanced Science, EarlyView.Geometric constraint reconfiguration enables a rigid–foldable kirigami‐inspired mechanism to switch between twisting, directional translation, and self‐locking states. By encoding multifunctionality directly into its architecture, the mechanism achieves multimodal motion and passive locking without reassembly, providing a compact platform for adaptive ...
Jianlin Wang, Zhongmin Song, Ketao Zhang
wiley +1 more source
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
Journal of Graph Algorithms and ApplicationsDetermining the crossing numbers of Cartesian products of small graphs with arbitrarily large paths has been an ongoing topic of research since the 1970s.
Zayed Asiri +5 more
doaj +1 more source
Cartesian Double Categories with an Emphasis on Characterizing Spans
, 2018 In this thesis, we introduce Cartesian double categories, motivated by the work of Carboni, Kelly, Walters, and Wood on Cartesian bicategories. Moving from bicategories to the slightly more generalized notion of double categories allows us to set the ...
Aleiferi, Evangelia
core