Results 131 to 140 of about 39,087 (298)

Generalized Rainbow Connection of Graphs and their Complements

Discussiones Mathematicae Graph Theory, 2018
Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang, Magnant Colton, Wei Meiqin, Zhu Xiaoyu   +3 more
doaj   +1 more source

Monochromatic triangles in three-coloured graphs [PDF]

, 2013
In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph whose edge set is 2-coloured. Goodman (1985) [10] also raised the question of proving analogous results for complete graphs whose edge sets are coloured ...
Král', D., Sperfeld, Konrad, Andrew Treglown (5366114), James Cummings (3886624), Treglown, Andrew, Sperfeld, K., Pfender, F., Treglown, A., Florian Pfender (5366111), Young, M., Králʼ, Daniel, Cummings, J., Pfender, Florian, Konrad Sperfeld (5366108), Daniel Kral (5366105), Cummings, James, Young, Michael   +16 more
core   +1 more source

Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators

Advanced Engineering Materials, EarlyView.
A comprehensive study of critical parameters required to develop well‐performing Ti–Ni–Cu thin film shape memory alloy microactuators is provided. Materials science and device integration aspects are integrated by addressing structural and physical relationships using complementary characterization techniques as well as a practical fabrication solution
Elaheh Akbarnejad, Aleksander Kostka, Gowtham Arivanandhan, Yujiao Li, Alan Savan, Manfred Kohl, Alfred Ludwig   +6 more
wiley   +1 more source

Semi-Direct Product of Edge Colored Graphs

, 2005
A distance can be defined on a complete graph, called an edge colored graph. Edge colored graphs have many properties; however, this paper is mostly concerned with homogeneity and algebraic properties of edge colored graphs.
O\u27Connor, Charles
core  

PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science

Advanced Engineering Materials, EarlyView.
Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley   +1 more source

Recycling of NiTi Shape Memory Alloys: Fundamental and Technological Aspects of a Vacuum Induction Melting Processing Route

Advanced Engineering Materials, EarlyView.
The present study investigates recycling of NiTi shape memory alloys via vacuum induction melting. An ingot was synthesized from elemental Ni and Ti and subjected to three subsequent remelting cycles. Remelting increases process durations and impurity levels and adversely affects microstructures and functional properties.
Sakia Sophia Noorzayee, Son Tung Mai, Sarath Menon, Braulio Gadiel Sánchez Ortega, Ralf Drautz, Alexander Kauffmann, Gunther Eggeler, Jan Frenzel   +7 more
wiley   +1 more source

Edge coloring of small signed graphs

TASK Quarterly
In 2020, Behr introduced the problem of edge coloring of signed graphs and proved that every signed graph (G, sigma) can be colored using Delta(G) or Delta(G) + 1 colors, where Delta(G) denotes the maximum degree of G.
Robert Janczewski, Krzysztof Turowski, Bartłomiej Wróblewski   +2 more
doaj  

Graphs with 3-Rainbow Index n − 1 and n − 2

Discussiones Mathematicae Graph Theory, 2015
Let G = (V (G),E(G)) be a nontrivial connected graph of order n with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Li Xueliang, Schiermeyer Ingo, Yang Kang, Zhao Yan   +3 more
doaj   +1 more source

Workflow for Design of Experiments‐Based Modeling of Species Transport and Growth Kinetics in GaN Hydride Vapor Phase Epitaxy

Advanced Engineering Materials, EarlyView.
A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič, G. Lukin, H. Torkashvand, A. Kerschbaum, M. Müller, S. Besendörfer, J. Heitmann, J. Friedrich   +7 more
wiley   +1 more source

Characterizations of Graphs Having Large Proper Connection Numbers

Discussiones Mathematicae Graph Theory, 2016
Let G be an edge-colored connected graph. A path P is a proper path in G if no two adjacent edges of P are colored the same. If P is a proper u − v path of length d(u, v), then P is a proper u − v geodesic. An edge coloring c is a proper-path coloring of
Lumduanhom Chira, Laforge Elliot, Zhang Ping   +2 more
doaj   +1 more source