Results 101 to 110 of about 395,936 (323)

Effects of loading frequency on cyclic parameters of unsaturated Zenoz kaolin

E3S Web of Conferences, 2016
According to the considerable effects of the loading frequency on the cyclic behaviour of the soils and lack of the sufficient and precise data in this field for the unsaturated soils, more attention needs to be paid to the experimental investigations in
Mojezi Mohsen, Biglari Mahnoosh, Jafari Mohammad Kazem   +2 more
doaj   +1 more source

Identifiable Paths and Cycles in Linear Compartmental Models. [PDF]

Bull Math Biol, 2022
Bortner C, Meshkat N.
europepmc   +1 more source

On Rainbow Cycles and Paths

, 2012
In a properly edge colored graph, a subgraph using every color at most once is called rainbow. In this thesis, we study rainbow cycles and paths in proper edge colorings of complete graphs, and we prove that in every proper edge coloring of K_n, there is a rainbow path on (3/4-o(1))n vertices, improving on the previously best bound of (2n+1)/3 from ...
Gebauer, Heidi, Mousset, Frank
openaire   +2 more sources

Ultrasonic Atomization Spray Coating of PCL on an Mg‐Based Alloy Enhanced by Plasma Electrolytic Oxidation for Improved Adhesion, Corrosion Resistance, and Biocompatibility

Advanced Engineering Materials, EarlyView.
Plasma electrolytic oxidation is combined with ultrasonic spray deposition of polycaprolactone (PCL) on WE43 magnesium alloy to improve adhesion, corrosion resistance, and cytocompatibility. The hybrid coating demonstrates significantly reduced hydrogen evolution and enhances mechanical bonding, offering a promising strategy for next‐generation ...
Seyed Masih Mousavizadeh, Atiyeh Adelinia, Frederick D. Crowley, Jamal Seyyed Monfared Zanjani, John J. E. Mulvihill, Mingzhi Yu, Ehsan Rezvani, Matthijn de Rooij, Michael D. Gilchrist, Nan Zhang   +9 more
wiley   +1 more source

Decomposition of hypercube graphs into paths and cycles having k edges

AKCE International Journal of Graphs and Combinatorics
For an even graph G and positive integer p, q, and k, the pair (p, q) is an admissible pair if [Formula: see text]. If a graph G admits a decomposition into p copies of [Formula: see text], the path of length k, and q copies of Ck, the cycle of length k,
D. Saranya, S. Jeevadoss, V. Nalini, V. Chitra   +3 more
doaj   +1 more source

On the Metric Dimension of Generalized Tensor Product of Interval with Paths and Cycles

Journal of Mathematics, 2020
The concept of minimum resolving set for a connected graph has played a vital role in Robotic navigation, networking, and in computer sciences. In this article, we investigate the values of m and n for which P2⊗mPn and P2⊗mCn are connected and find ...
Song Li, Jia-Bao Liu, Mobeen Munir
doaj   +1 more source

Programmable Reconfiguration of Hybrid 4D Chiral Metamaterials via Mechanical and Thermal Stimuli

Advanced Engineering Materials, EarlyView.
A class of hybrid chiral mechanical metamaterials is designed to achieve programmable reconfiguration through soft networks, hinges, and bilayer joints integrated with rigid units. Responsive to mechanical and thermal stimuli, these structures exhibit large volume changes, tunable deformation pathways, and both positive and negative thermal expansion ...
Yunyao Jiang, Siyao Liu, Yaning Li
wiley   +1 more source

Decomposition of Regular Bipartite Graphs Into Hamiltonian Cycles (Paths) and S3

Journal of Mathematics
Let G be either a complete bipartite graph with n (even) vertices in each partite or a complete bipartite graph with n (odd) vertices in each partite plus a 1‐factor.
null V. Nalini, null S. Jeevadoss
doaj   +1 more source

Equitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths

International Journal of Mathematics and Mathematical Sciences, 2011
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interesting results regarding the equitable chromatic number 𝜒= for the total graph of complete bigraphs 𝑇(𝐾𝑚,𝑛), the central graph of cycles 𝐶(𝐶𝑛) and the central ...
J. Vernold Vivin, K. Kaliraj, M. M. Akbar Ali   +2 more
doaj   +1 more source

The Cycle-Path Indicator Polynomial of a Digraph

Advances in Applied Mathematics, 2000
A cycle-path cover of a digraph is a spanning subgraph whose components are paths and cycles. The authors introduce what they call the cycle-path indicator polynomial of a digraph in order to count the cycle-path covers according to their type. They study the properties of this polynomial, in particular, the polynomial satisfies a deletion-contraction ...
O. M. D'Antona, MUNARINI, EMANUELE
openaire   +4 more sources