Results 111 to 120 of about 1,484,168 (305)

Catalytically Enhanced Near Room‐Temperature Hydrogen Sensing Using Pd‐ZnO Colloidal Crystals

Advanced Functional Materials, EarlyView.
Pd‐decorated ZnO colloidal crystal monolayers demonstrate excellent performance across a wide hydrogen concentration range at 33°C, with high selectivity and reproducible device fabrication. The sensors show strong responses even at low‐ppm H2 concentrations and an ultra‐low detection limit of 82 ppb, indicating their suitability for diverse hydrogen ...
Hamidah Alluhaybi, Samuel J. Ippolito, Chung Kim Nguyen, Durairaj Mahendiran, Michelle J. S. Spencer, Edwin L. H. Mayes, Billy James Murdoch, Jason Choi, Shamali De Silva, James Tardio, Adrian Trinchi, Ahmad E. Kandjani, Mohammad Al Kobaisi, Ylias Sabri   +13 more
wiley   +1 more source

On the Synthesis of Planar Graphs with Given Properties

Кібернетика та комп'ютерні технології
The problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj   +1 more source

Gerrymandering Planar Graphs

International Joint Conference on Autonomous Agents and Multiagent Systems
We study the computational complexity of the map redistricting problem (gerrymandering). Mathematically, the electoral district designer (gerrymanderer) attempts to partition a weighted graph into k connected components (districts) such that its candidate (party) wins as many districts as possible. Prior work has principally concerned the special cases
Dippel, J., Tour, M.D.L., Niu, A., Roy, S., Vetta, A.   +4 more
openaire   +5 more sources

Conformational Switching of Proteins on Material Surfaces Enabled by Peptide‐Oriented Adsorption

Advanced Functional Materials, EarlyView.
Responsive biointerfaces could be achieved using conformationally responsive proteins; however, their interconversion can be lost upon surface adsorption. Herein, we demonstrate that the incorporation a Au binding peptide into calmodulin allows for binding control on Au wherein the protein retains conformational switching. This capability was confirmed
Sakthirupini Ramamurthy, Kyle B. Meerbott, Lorenzo Travaglini, Garima S. Dobhal, Artur Sawicki, Marc R. Knecht, Tiffany R. Walsh, Dominic J. Glover   +7 more
wiley   +1 more source

Rook-drawings of Plane Graphs

Journal of Graph Algorithms and Applications, 2017
We introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node.
David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun   +3 more
doaj   +1 more source

Multifunctional Solid Polymer Electrolyte Films Integrating Intrinsic Self‐Healing and Dual Photo‐/pH‐Responsive Ionic Sensing for Intelligent Flexible Electronics

Advanced Functional Materials, EarlyView.
Multifunctional solid polymer electrolyte (SPE) films integrating intrinsic self‐healing, mechanical stretchability, and dual photo‐ and pH‐responsive ionic conductivity are developed. Constructed from thermoplastic polyurethane (TPU) and hydrogen‐bonded poly(thiourea triethylene glycol) (PTUEG3), these films form a dynamic supramolecular network ...
Mei‐Li Li, Tse‐Yu Lo, Chia‐Wei Chang, Yen‐Shen Hsu, Chen‐Yi Chien, Yu‐Yao Huang, Chia‐Ti Wu, Chun‐Chi Chang, Bo‐Chen Chen, Heng‐Hsuan Su, Chin‐Hua Liu, Che‐Ning Yeh, Jiun‐Tai Chen   +12 more
wiley   +1 more source

1-Planarity of Graphs with a Rotation System

Journal of Graph Algorithms and Applications, 2015
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for near-planar graphs in which an edge is added to a planar
Christopher Auer, Franz Brandenburg, Andreas Gleißner, Josef Reislhuber   +3 more
doaj   +1 more source

On cleaving a planar graph

Discrete Mathematics, 1990
Let G be a planar n-vertex graph with non-negative vertex weights which sum to no more than 1. It is proved that G can be recursively separated into components of weight \(\leq \epsilon\) by removing \(4\sqrt{n/\epsilon}\) vertices. Applications to planar graphs with given radius are considered.
openaire   +3 more sources

One‐Step Curcumin‐Mediated Multiphoton Lithography for Bioactive 3D Scaffolds

Advanced Functional Materials, EarlyView.
Curcumin‐mediated multiphoton lithography enables one‐step fabrication of highly architected complex gelatin methacryloyl scaffolds by exploiting curcumin as a multifunctional bioactive photoinitiator. The resulting 3D structures support mesenchymal stem cell adhesion, proliferation, and migration, while exhibiting dual antibacterial activity through ...
Myrto Charitaki, Michalis Stavrou, Chrysanthi Pinelopi Apostolidou, Elmina Kabouraki, David Gray, Anna Mitraki, Anthi Ranella, Maria Farsari   +7 more
wiley   +1 more source

DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles

Mathematics
In order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj   +1 more source