Results 81 to 90 of about 2,463 (224)
On perfect codes in Cartesian products of graphs
Assuming the existence of a partition in perfect codes of the vertex set of a finite or infinite bipartite graph $G$ we give the construction of a perfect code in the Cartesian product $ G \Box G \Box P_2$. Such a partition is easily obtained in the case of perfect codes in Abelian Cayley graphs and we give some example of applications of this result ...
openaire +3 more sources
On $H$-antimagicness of Cartesian product of graphs
Summary: A graph \(G=(V(G),E(G))\) admits an \(H\)-covering if every edge in \(E\) belongs to a subgraph of \(G\) isomorphic to \(H\). A graph \(G\) admitting an \(H\)-covering is called \((a,d)\)-\(H\)-antimagic if there is a bijection \(f:V(G)\cup E(G) \to \{1,2,\dots, |V(G)|+|E(G)| \}\) such that, for all subgraphs \(H^\prime\) of \(G\) isomorphic ...
Bača, Martin +3 more
openaire +2 more sources
The Well-Covered Dimension Of Products Of Graphs
We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found, provided that G has a largest greedy ...
Birnbaum Isaac +4 more
doaj +1 more source
Abstract Dental plates are pivotal in the lungfish paleontological record, constituting highly mineralized structures resilient to diagenetic processes. This study provides a detailed description and quantitative shape analysis of 95 newly discovered Gnathorhiza sp. dental plates from the Middle–Late Permian Corumbataí Formation, Brazil.
Mauro B. S. Lacerda +4 more
wiley +1 more source
Abstract Information science rests on a compact: its mediating signs maintain a traceable relation to what they describe. Large language models (LLMs) break it architecturally, generating discourse that is statistically plausible yet epistemically ungrounded, while standard metrics (precision, recall, relevance) cannot detect the rupture.
Martin Thellefsen, Alon Friedman
wiley +1 more source
We introduce certain concepts, including cubic graphs, internal cubic graphs, external cubic graphs, and illustrate these concepts by examples. We deal with fundamental operations, Cartesian product, composition, union and join of cubic graphs.
Sheikh Rashid +3 more
doaj +2 more sources
Unlocking the chemistry of caramel by simulations and experimental validation. αFFase1${\alpha }\rm{FFase1}$ converts inulobiose into difructose dianhydride I, one component of caramel, through two steps: a rate‐limiting glycosylation (with a rare sugar ring flip) followed by a cyclization step, guided by residues E85, K147, and N226.
Santiago Alonso‐Gil +7 more
wiley +1 more source
Clique Minors in Cartesian Products of Graphs
A "clique minor" in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The "Hadwiger number" h(G) is the maximum cardinality of a clique minor in G. This paper studies clique minors in the Cartesian product G*H.
openaire +3 more sources
A Geometric Characterization of Steady Laminar Flow
ABSTRACT We study the steady states of the Euler equations on the periodic channel or annulus. We show that if these flows are laminar (layered by closed non‐contractible streamlines which foliate the domain), then they must be either parallel or circular flows.
Theodore D. Drivas, Marc Nualart
wiley +1 more source
Generative Models in Inorganic Crystals Discovery and Inverse Design
Generative inverse‐design samples from the vast inorganic crystal design space by starting from target properties such as band gap, stability, and ion transport. This Review examines the representations, generative models, and validation workflows needed to translate candidate structures into stable, potentially synthesizable materials for applications
Tao Li +5 more
wiley +1 more source

