Results 51 to 60 of about 1,679,013 (321)
In this study, the mechanical response of Y‐shaped core sandwich beams under compressive loading is investigated, using deep feed‐forward neural networks (DFNNs) for predictive modeling. The DFNN model accurately captures stress–strain behavior, influenced by design parameters and loading rates.
Ali Khalvandi +4 more
wiley +1 more source
Recognition of Unipolar and Generalised Split Graphs
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar.
Colin McDiarmid, Nikola Yolov
doaj +1 more source
Perfect codes in some products of graphs
A r-perfect code in a graph G = (V(G),E(G)) is a subset C of V(G) for which the balls of radius r centered at the vertices of C form a partition of V(G).
Samane Bakaein +2 more
doaj +1 more source
Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source
Perfect secure domination in graphs [PDF]
Let $G=(V,E)$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $Vsetminus S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $vin Vsetminus S$ there exists $uin S$ such that
S.V. Divya Rashmi +3 more
doaj
From Nature to Engineering: Mortar Volume and Interfacial Mechanics in Bioinspired Ceramics
Inspired by natural armors like nacre, this study explores how varying the volume fraction of the soft mortar layer impacts the interfacial strength and toughness of bioinspired ceramics. Experimental and computational analysis reveals that higher mortar volumes increase energy dissipation but reduce interfacial stiffness, offering insights for ...
Ehsan Azad +4 more
wiley +1 more source
Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers
In this paper, we consider the relationships between the numbers of perfect matchings (1-factors) of bipartite graphs and Pell, Mersenne and Perrin Numbers.
Öteleş Ahmet
doaj +1 more source
On Another Class of Strongly Perfect Graphs
For a commutative ring R with unity, the associate ring graph, denoted by AG(R), is a simple graph with vertices as nonzero elements of R and two distinct vertices are adjacent if they are associates.
Neha Kansal +3 more
doaj +1 more source
Complements of nearly perfect graphs [PDF]
A class of graphs closed under taking induced subgraphs is $\chi$-bounded if there exists a function $f$ such that for all graphs $G$ in the class, $\chi(G) \leq f(\omega(G))$. We consider the following question initially studied in [A.
A. Gyárfás +5 more
semanticscholar +1 more source
Franck-Condon factors by counting perfect matchings of graphs with loops. [PDF]
We show that the Franck-Condon Factor (FCF) associated with a transition between initial and final vibrational states in two different potential energy surfaces, having N and M vibrational quanta, respectively, is equivalent to calculating the number of ...
N. Quesada
semanticscholar +1 more source

