Results 51 to 60 of about 14,964 (295)
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 +2 more sources
On the Crossing Numbers of Cartesian Products of Wheels and Trees
Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián +2 more
doaj +1 more source
Photoaligned and photopatterned liquid crystal platforms provide programmable control of optical phase, polarization, and spin‐orbit interactions, enabling compact generation of structured light and complex wavefronts. This review highlights how tailored molecular orientations transform simple beams into designed optical fields, opening versatile ...
Le Zhou +6 more
wiley +1 more source
Efficient subgraph matching by postponing Cartesian products [PDF]
© 2016 ACM. In this paper, we study the problem of subgraph matching that extracts all subgraph isomorphic embeddings of a query graph q in a large data graph G.
Qin, L +9 more
core +1 more source
Genus of the Cartesian Product of Triangles. [PDF]
We investigate the orientable genus of $G_n$, the cartesian product of $n$ triangles, with a particular attention paid to the two smallest unsolved cases $n=4$ and $5$. Using a lifting method we present a general construction of a low-genus embedding of $G_n$ using a low-genus embedding of $G_{n-1}$.
Michal Kotrbcík, Tomaz Pisanski
openaire +2 more sources
Opportunities of Semiconducting Oxide Nanostructures as Advanced Luminescent Materials in Photonics
The review discusses the challenges of wide and ultrawide bandgap semiconducting oxides as a suitable material platform for photonics. They offer great versatility in terms of tuning microstructure, native defects, doping, anisotropy, and micro‐ and nano‐structuring. The review focuses on their light emission, light‐confinement in optical cavities, and
Ana Cremades +7 more
wiley +1 more source
Retract rigid cartesian products of graphs [PDF]
A graph G is retract rigid if any retract of itself is isomorphic to G. The Cartesian product G x H of graphs G and H is the graph with vertex set V(G) x V(H) and edges ((a, b), (c, d)) whenever either (a, c) ϵ E(G) and b = d, or a = c and (b, d) ϵ E(H).
Rival, Ivan, Nowakowski, Richard
core +1 more source
The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths
An edge-colored graph G is rainbow k-connected, if there are k-internally disjoint rainbow paths connecting every pair of vertices of G. The rainbow k-connection number of G, denoted by rck(G), is the minimum number of colors needed for which there ...
Bety Hayat Susanti +2 more
doaj +1 more source
Drawing inspiration from the layered hard‐soft architecture found in sea sponges, this work establishes a new framework for architected cementitious composites (ACC) through multi‐material additive manufacturing (MMAM) process. The integration of mortar and elastomer phases into layered architectures enables synergistic toughening mechanisms, including
Aimane Najmeddine +5 more
wiley +1 more source
A characterization of well-dominated Cartesian products [PDF]
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 +1 more source

