Results 101 to 110 of about 505,548 (331)

哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)

Zhejiang Daxue xuebao. Lixue ban, 2009
Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj   +1 more source

Perfect matchings of a graph

Journal of Combinatorial Theory, Series B, 1971
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Problem. A short proof is exhibited and some consequences of the theorem are discussed.
openaire   +3 more sources

SMaRT Stacking: A Methodology to Produce Optimally Layered EMI Shields with Maximal Green Index Using Fused Deposition Modeling

Advanced Functional Materials, EarlyView.
Electromagnetic interference (EMI) shields consisting of polylactic acid (PLA) in layers with different concentrations of multiwalled carbon nanotubes (MWCNT) are produced using additive manufacturing. The permittivity function of layers with different filler concentrations is learned using data of homogeneous and randomly ordered shields.
Stijn De Smedt, Brecht Evens, Pramod Ravichandran, Panagiotis Patrinos, Frederik Van Loock, Ruth Cardinaels   +5 more
wiley   +1 more source

Approximating Maximum Edge 2-Coloring by Normalizing Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors.
Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze   +4 more
doaj   +1 more source

Contractions in perfect graphs

Discrete Applied Mathematics
In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph is contraction perfect if and only if it is perfect and the contraction of any single edge preserves its perfection.
Alexandre Dupont-Bouillard, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix   +3 more
openaire   +2 more sources

Advanced Surface Engineering and Passivation Strategies of Quantum Dots for Breaking Efficiency Barrier of Clean Energy Technologies: A Comprehensive Review

Advanced Functional Materials, EarlyView.
This review describes the different surface engineering strategies for quantum dots that addresses the challenges associated with surface defects, highlighting their role in enhancing the performance of solar energy conversion technologies. Abstract Colloidal quantum dots (QDs) have garnered significant attention for their unique potential in clean ...
Kokilavani S., Gurpreet Singh Selopal
wiley   +1 more source

Design and Applications of Multi‐Frequency Programmable Metamaterials for Adaptive Stealth

Advanced Functional Materials, EarlyView.
This article provides a comprehensive overview of metamaterials, including their fundamental principles, properties, synthesis techniques, and applications in stealth, as well as their challenges and future prospects. It covers topics that are more advanced than those typically discussed in existing review articles, while still being closely connected ...
Jonathan Tersur Orasugh, Ankita Mohanty, Amit Malakar, Suryasarathi Bose, Suprakas Sinha Ray   +4 more
wiley   +1 more source

On connected components and perfect codes of proper order graphs of finite groups [PDF]

Proceedings of the Estonian Academy of Sciences
Let G be a finite group with the identity element e. The proper order graph of G, denoted by ℒ* (G), is an undirected graph with a vertex set G \ {e}, where two distinct vertices x and y are adjacent whenever o(x) | o(y) or o(y) | o(x), where o(x) and ...
Huani Li, Shixun Lin, Xuanlong Ma
doaj   +1 more source

Unleashing the Power of Machine Learning in Nanomedicine Formulation Development

Advanced Functional Materials, EarlyView.
A random forest machine learning model is able to make predictions on nanoparticle attributes of different nanomedicines (i.e. lipid nanoparticles, liposomes, or PLGA nanoparticles) based on microfluidic formulation parameters. Machine learning models are based on a database of nanoparticle formulations, and models are able to generate unique solutions
Thomas L. Moore, Cristiano Pesce, Antonietta Greco, Claudia Pisante, Greta Avancini, Valentina Di Francesco, Yosi Shamay, Paolo Decuzzi   +7 more
wiley   +1 more source

Choice-perfect graphs

Discussiones Mathematicae Graph Theory, 2013
Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E. If such a ϕ exists, G is said to be list colorable.
openaire   +3 more sources