Results 111 to 120 of about 3,659,008 (292)

An upper bound for star chromatic index of simple connected sub-cubic graphs and applications

Journal of the National Science Foundation of Sri Lanka
This paper explores the star edge coloring of simple connected sub-cubic graphs, which is a more restricted way of edge coloring. The idea of star edge coloring was introduced by two mathematicians Liu and Deng in 2008, motivated by its vertex version ...
C. L. R. Fernando, A. M. C. U. M. Athapattu   +1 more
doaj   +1 more source

Increased Disarray of Extracellular Matrix Collagen‐I Fiber Network and Compromised Biomechanics in Aortae From Marfan‐Syndrome Mice Assessed Through Combined Opto‐Biomechatronics

Advanced Science, EarlyView.
Combined structure‐function assessment in aortic rings from Marfan mice using MechaMorph Opto‐Biomechatronics technology relates increased elasticity (stiffness) and dynamic viscosity and less ordered extracellular matrix 3D‐structure (collagen) as potential causes for impaired Windkessel function and compromised haemodynamics in Marfan's syndrome ...
Dominik Schneidereit, Anika Nagel, Vanessa I. T. Zwaans, Laureen Schurr, Jonas Ahr, Michael Haug, Anna Piluso, Alexandra Sporkova, Matthias Karck, Andreas H. Wagner, Oliver Friedrich   +10 more
wiley   +1 more source

Upper Bounds for the Strong Chromatic Index of Halin Graphs

Discussiones Mathematicae Graph Theory, 2018
The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2.
Hu Ziyu, Lih Ko-Wei, Liu Daphne Der-Fen
doaj   +1 more source

Mechanophore‐Based Multichannel Colorimetric Force Sensors: Ultrasound‐Driven Stress and Strain Quantification

Advanced Science, EarlyView.
ABSTRACT Mechanophores with mechanochromic properties have attracted significant attention as force‐responsive materials for structural sensing. However, their applications remain mainly limited to qualitative force visualization, as direct and quantitative extraction of mechanical parameters such as stress and strain from mechanochromic responses has ...
Seungo Baek, Jeong Hoon Rhee, Skylar K. Osler, Minsoo P. Kim, Shyuan Cheng, Leonardo P. Chamorro, Hyunhyub Ko, Maxwell J. Robb, Gun Kim   +8 more
wiley   +1 more source

Selenophene π‐Core Fusion for Simultaneous Fast Reverse Intersystem Crossing and Narrowband Long‐Wavelength TADF

Angewandte Chemie, EarlyView.
Dibenzo[b,d]selenophene (DBSe) π‐core fusion enables rapid triplet–singlet interconversion while preserving the narrowband emission features of multi‐resonance thermally activated delayed fluorescence (MR‐TADF) luminogens. Combined with peripheral donor engineering, this strategy enables systematic emission tuning from green to red, leading to highly ...
Jingpeng Zhang, Jun Hyeon Lee, Guanting Liu, Tatsuya Mori, Takuma Yasuda   +4 more
wiley   +2 more sources

Cross‐scale Material‐Structure Synergy for 2D Metamaterials: Toward Customizable Intelligent Electromagnetic Manipulation in Multiphysics Fields

Advanced Science, EarlyView.
Recent advances in metasurface‐enabled low‐observable technologies are reviewed from the perspective of cross‐scale material–structure synergy. Electromagnetic, thermal, optical, and acoustic stealth are highlighted together with dynamic tuning, programmable coding, data‐driven inverse design, artificial intelligence, multispectral compatibility, and ...
Shuhao Wang, Xing Yang, Liping Liu, Yang Peng, Yangyang Wang, Hualiang Lv   +5 more
wiley   +1 more source

On the Oriented Chromatic Index of Oriented Graphs

, 2008
International audienceA homomorphism from an oriented graph G to an oriented graph H is a mapping f from the set of vertices of G to the set of vertices of H such that f(U)f(V) is an arc in H whenever uv is an arc in G. The oriented chromatic index of an
Sopena, Eric, Pinlou, Alexandre, Ochem, Pascal   +2 more
core   +1 more source

The Chromatic Index of Ring Graphs [PDF]

, 2023
The goal of graph edge coloring is to color a graph G with as few colors as possible such that each edge receives a color and that adjacent edges, that is, different edges incident to a common vertex, receive different colors.
Shaffer, Lilian
core  

Conflict-free chromatic index of trees

Theoretical Computer Science
A graph $G$ is conflict-free $k$-edge-colorable if there exists an assignment of $k$ colors to $E(G)$ such that for every edge $e\in E(G)$, there is a color that is assigned to exactly one edge among the closed neighborhood of $e$. The smallest $k$ such that $G$ is conflict-free $k$-edge-colorable is called the conflict-free chromatic index of $G ...
Shanshan Guo, Ethan Y. H. Li, Luyi Li, Ping Li 0025   +3 more
openaire   +4 more sources

Adaptive Network Stabilization Despite Profound Structural Reorganization in Human Organotypic Cultures

Advanced Science, EarlyView.
Adult human organotypic cortical slices undergo marked neuronal loss, laminar disruption, and glial activation, yet their network activity progressively stabilizes after a variable period. Electrophysiology, longitudinal calcium imaging, and quantitative histology show that structurally remodeled human circuits show adaptive capacity resulting in ...
Estilla Zsófia Tóth, Rebeka Stelcz, Réka Bod, Ábel Petik, Eszter Juhász, Kinga Tóth, Liza Szalai, Nour Essam, Fanni Somogyi, Beatrix Kovács, Amirmahdi Mojtahedzadeh, Attila György Bagó, Loránd Erőss, Péter Orbay, Johanna Petra Szabó, Dániel Fabó, Boglárka Hajnal, Bence Rácz, Daniel Hillier, István Ulbert, Lucia Wittner   +20 more
wiley   +1 more source