Results 111 to 120 of about 1,000,377 (259)

Special Graceful Labelings of Irregular Fences and Lobsters

open access: yesUniversal Journal of Mathematics and Applications, 2019
Irregular fences are subgraphs of $P_m \times P_n$ formed with $m$ copies of $P_n$ in such a way that two consecutive copies of $P_n$ are connected with one or two edges; if two edges are used, then they are located in levels separated an odd number of ...
Christian Barrientos
doaj   +1 more source

Low‐Dimensional Materials and Van Der Waals Heterostructures for Energy Application: A Comprehensive Review

open access: yesENERGY &ENVIRONMENTAL MATERIALS, EarlyView.
Low‐dimensional materials (0D, 1D, and 2D) exhibit unique electronic and physicochemical properties, enabling advanced nanoelectronic and optoelectronic devices. Mixed‐dimensional heterostructures combine these materials to enhance functionality.
Qaisar Alam   +3 more
wiley   +1 more source

Some Graceful Graphs

open access: yesJournal of Mathematics Research, 2012
We have investigated some general classes of disconnected graceful graphs. We obtain the graceful labeling for $(P_{m} \times P_{n})~\bigcup~(P_{r} \times P_{s})$,~$C_{2f+3}~\bigcup~(P_{m} \times P_{n})~\bigcup~(P_{r} \times P_{s})$, where $ m,~n,~ r, ~s \in N - \{1\} $ and $f= 2(mn + rs) - (m + n + r + s)$.
V. J. Kaneria, H. M. Makadia
openaire   +2 more sources

Decentralized Federated Learning for Wind Turbine Bearing Prognostics Under Data Scarcity and Statistical Heterogeneity

open access: yesEnergy Science &Engineering, EarlyView.
This paper proposes a decentralized peer‐to‐peer federated learning framework for wind turbine bearing remaining useful life prediction, introducing a virtual client paradigm in which statistical health indicators serve as independent feature‐level clients—enabling privacy‐preserving collaborative prognostics from a single physical asset under ...
Jihene Sidhom   +2 more
wiley   +1 more source

Recent advances in multifunctional soft robots: A materials–structures–systems co‐design perspective for synergistic integration

open access: yesFlexMat, EarlyView.
Abstract Soft robots, engineered from highly compliant materials, offer superior adaptability and safety in unstructured environments compared to their rigid counterparts. Recent advancements, fueled by bio‐inspiration and material programmability, have led to the rapid co‐evolution of their core modules: actuation, sensing, protection, energy, and ...
Qiulei Liu   +3 more
wiley   +1 more source

The plant microbiome: From ecological foundations to precision microbial engineering for sustainable agriculture

open access: yesiMeta, EarlyView.
From ecological principles to precision engineering of plant microbiomes for sustainable agriculture. The plant holobiont integrates diverse microbial niches (including rhizosphere, endosphere, phyllosphere, seed, and aerial‐root mucilagesphere), host genetics (namely M genes), and host metabolites. Furthermore, molecular dialogues, including rhizobial
Mi Wei   +26 more
wiley   +1 more source

Beyond omics: From descriptive profiling to causal and scalable design of fermentation microbiomes

open access: yesiMeta, EarlyView.
Fermentation microbiomes play essential roles in food production, feed preservation, waste valorization, and diverse sustainable industrial processes. Although multi‐omics and systems biology have substantially advanced our understanding of their assembly, interactions, and functional dynamics, industrial translation remains constrained by fragmented ...
Dongze Niu   +22 more
wiley   +1 more source

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch   +5 more
wiley   +1 more source

A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley   +1 more source

Home - About - Disclaimer - Privacy