Results 51 to 60 of about 45,382 (265)

Discrepancies Between Micro Versus Macroscale Viscoelastic Properties in a Microplastic‐Tissue Composite Model

open access: yesAdvanced Engineering Materials, EarlyView.
This study explores the discrepancies between bulk mechanics and spatial mapping in a tissue‐mimetic hydrogel model. Microplastic particles create localized stiff mechanical microenvironments that are detectable by cellular‐scale nanoindentation but leave bulk properties unchanged as measured by rheology.
Ahron T. Verschleisser   +3 more
wiley   +1 more source

Limit distributions of maximum vertex degree in a conditional configuration graph

open access: yesTransactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018
We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed  random variables following the power-law distribution with positive parameter τ.
Irina Cheplyukova
doaj   +1 more source

Controlling Grain Growth in Powder Bed Fusion of Yttria‐Stabilized Zirconia Using Femtosecond Lasers: Challenges and Methodological Insights

open access: yesAdvanced Engineering Materials, EarlyView.
Binder‐free laser powder bed fusion of 8YSZ with a femtosecond laser is used to map process windows linking scan strategy, heat accumulation, and grain growth. Time‐resolved thermography and simulations reveal thermal regimes that enable continuous, vitrified, and fine‐grained 8YSZ surface layers without absorptive additives and demonstrate ...
Markus Kühn   +5 more
wiley   +1 more source

A SURVEY M-POLAR FUZZY GRAPHS [PDF]

open access: yesFiabilitate şi Durabilitate, 2019
I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [17] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area.
Iuliana Carmen BĂRBĂCIORU
doaj  

On the Number of Spanning Trees of Graphs

open access: yesThe Scientific World Journal, 2014
We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Δ1), minimum vertex degree (δ), …first Zagreb index (M1), and Randić index (R-1).
Ş. Burcu Bozkurt, Durmuş Bozkurt
doaj   +1 more source

Simulation‐Based Analysis of Insert Pull‐Out in Nickel‐Polyurethane Hybrid Foams Using CT‐Derived Geometries

open access: yesAdvanced Engineering Materials, EarlyView.
CT‐based finite element simulations combined with in situ X‐ray computed tomography are used to analyze insert pull‐out in nickel‐coated polymer foams. Despite variations in material parameters, deformation consistently concentrates within a narrow annular region around the insert.
Yannik Bautz   +4 more
wiley   +1 more source

A Note on Distance-Based Entropy of Dendrimers

open access: yesAxioms, 2019
This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to all graphs representing the isomers of octane. Taking into account the vertex degree as well (degree-ecc-entropy), we find a good correlation with the ...
Modjtaba Ghorbani   +4 more
doaj   +1 more source

The Role of Ultra‐Thin Passive Films and Organic Adsorbates on Aluminum Chips for a Friction‐Induced Solid‐State Recycling Process

open access: yesAdvanced Engineering Materials, EarlyView.
Despite benefits to storage stability and handleability of aluminum scrap, octadecyl phosphonic acid (ODPA) SAMs reduce the tensile strength of wires produced using friction‐induced recycling. Etching and methyl diphosphonic acid (MDPA) coatings, however, have little effect.
Timothy D. Goller   +3 more
wiley   +1 more source

Sparse Vertex Cutsets and the Maximum Degree

open access: yesThe Electronic Journal of Combinatorics
We show that every graph $G$ of maximum degree $\Delta$ and sufficiently large order has a vertex cutset $S$ of order at most $\Delta$ that induces a subgraph $G[S]$ of maximum degree at most $\Delta-3$. For $\Delta\in \{ 4,5\}$, we refine this result by considering also the average degree of $G[S]$.
Stéphane Bessy   +3 more
openaire   +4 more sources

On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion

open access: yesJournal of Discrete Algorithms, 2015
16 pages, 4 figures, submitted to Elsevier's Journal of Discrete ...
Sounaka Mishra   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy