Results 41 to 50 of about 5,083 (246)
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs [PDF]
Let $G$ be a graph and $chi^{prime}_{aa}(G)$ denotes the minimum number of colors required for an acyclic edge coloring of $G$ in which no two adjacent vertices are incident to edges colored with the same set of colors. We prove a general bound for $
Fatemeh Sadat Mousavi, Massomeh Noori
doaj +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
On a product of universal hyperalgebras
We introduce and study a new operation of product of universal hyperalgebras which lies, with respect to set inclusion, between the cartesian product of the hyperalgebras and the cartesian product of their idempotent hulls.
Chaisansuk Nitima, Šlapal Josef
doaj +1 more source
Cartesian product stabilization of 3-manifolds
The Cartesian product of a closed, orientable prime geometric 3-manifold and a closed orientable surface is unique except for the case of the Cartesian product of a special class of Seifert manifolds and a torus.
Witold Rosicki +3 more
core +1 more source
Karl Popper and the Mechanisms of Hydrogen Embrittlement
Representation of the beginning of loss of ductility rather than embrittlement. Small concentrations of hydrogen in a diffusible form within iron are well‐established to harm the mechanical integrity of steels. There are theories that attempt to explain the pernicious role of hydrogen.
H. K. D. H. Bhadeshia
wiley +1 more source
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
Total irregularity strength for product of two paths
In this paper we define a totally irregular total labeling for Cartesian and strong product of two paths, which is at the same time vertex irregular total labeling and also edge irregular total labeling.
Muhammad Kamran Siddiqui +2 more
doaj +1 more source
Factorization of Cartesian Products of Hypergraphs [PDF]
In this article we present the L2-section, a tool used to represent a hypergraph in terms of an "advanced graph" and results leading to first algorithm, in O(nm), for a bounded-rank, bounded-degree hypergraph H, which factorizes H in prime factors. The paper puts a premium on the characterization of the prime factors of a hypergraph, by exploiting ...
Alain Bretto, Yannick Silvestre
openaire +2 more sources
When is Cartesian product a Cayley graph?
A graph is said to be a Cayley graph if its automorphism group admits a regular subgroup. Automorphisms of the Cartesian product of graphs are well understood, and it is known that Cartesian product of Cayley graphs is a Cayley graph.
Hujdurović, Ademir +3 more
core
This article presents an experimental and numerical modal investigation of composite sandwich structures using surfboards as model systems. By comparing different core materials and reinforcement strategies, the study demonstrates how local stiffeners influence vibrational response and introduce characteristic modal features, highlighting modal ...
Brett Connellan +4 more
wiley +1 more source

