Results 111 to 120 of about 973,826 (351)

The Simple Geometry of Perfect Information Games [PDF]

open access: yes
Perfect information games have a particularly simple structure of equilibria in the associated normal form. For generic such games each of the finitely many connected components of Nash equilibria is contractible. For every perfect information game there
Demichelis, Stefano   +2 more
core  

Organic Materials of Tomorrow: Horizons of Artificial Intelligence

open access: yesAdvanced Materials, EarlyView.
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena   +3 more
wiley   +1 more source

COMPUTING THE ANTI-KEKULÉ NUMBER OF CERTAIN NANOTUBES AND NANOCONES

open access: yesStudia Universitatis Babes-Bolyai Chemia, 2015
Let G(V,E) be a connected graph. A set M subset of E is called a matching if no two edges in M have a common end-vertex. A matching M in G is perfect if every vertex of G is incident with an edge in M.
Mehar Ali MALIK, Muhammad IMRAN
doaj  

Resonance Graph of Perfect Matchings [PDF]

open access: yes, 2019
Let G be a graph with perfect matchings and let C be a set of linearly independent even cycles of G of width at most 2. The resonance graph R(G, C) is a graph with the vertex set M a subset of M(G) such that two vertices Mi and Mj are adjacent if and ...
Aluoch, James
core  

The Perfect Graph Conjecture For Toroidal Graphs

open access: yes, 1984
This chapter discusses the perfect graph conjecture for toroidal graphs. Graphs are assumed to be finite without loops or multiple edges. The ω (G) is defined as the size of the largest complete subgraph of G, while γ (G) is defined as the vertex ...
Grinstead, Charles M., Charles Grinstead
core   +1 more source

Perfect Graphs, Partitionable Graphs and Cutsets

open access: yesCombinatorica, 2002
We prove a theorem about cutsets in partitionable graphs that generalizes earlier results on amalgams, 2-amalgams and homogeneous pairs.
CONFORTI, MICHELANGELO   +3 more
openaire   +2 more sources

Data‐Driven Materials Science for Energy‐Sustainable Applications

open access: yesAdvanced Materials, EarlyView.
Data‐driven approaches powered by artificial intelligence are transforming materials discovery for energy sustainability. This review examines how auto‐generated high‐quality materials databases and domain‐specific language models accelerate research in photovoltaics, thermoelectrics, batteries and magnetic materials. Applications involve extraction of
Jacqueline M. Cole
wiley   +1 more source

Perfect Star Packings in (2,6)-Fullerene Graphs [PDF]

open access: yesMathematics Interdisciplinary Research
‎A (2,6)-fullerene graph is a planar and cubic graph with hexagonal and 2-length faces‎. ‎A perfect star packing is a spanning subgraph of a graph $G$ in which each component is isomorphic to the star graph $K_{1,3}$‎.
Meysam Taheri
doaj   +1 more source

Decomposing Berge graphs [PDF]

open access: yes
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no old hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that ...
Nicolas Trotignon
core  

Wearable Morphology‐Adaptive in‐Ear Device With Active Cleansing Capability for Multimodal Health Monitoring

open access: yesAdvanced Materials, EarlyView.
We present SCIENCE, an in‐ear multimodal physiological monitor featuring two key innovations. Water‐triggered morphological expansion (a 2‐mm cylinder to a 9‐mm spindle) achieves conformal adaptation across complex canal geometries. Simultaneously, active biofouling mitigation disrupts cerumen barriers, reducing sensor‐skin impedance by 20%.
Shuyun Zhuo   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy