Results 81 to 90 of about 2,245,805 (347)

The Influence of Annealing on the Sb Layer in the Synthesis of [001]‐Oriented Sb2Se3 Film for Photoelectrochemical Hydrogen Gas Generation

open access: yesAdvanced Functional Materials, EarlyView.
[001]‐oriented Sb2Se3 film with improved crystallinity and adjusted composition is achieved via a new thermal treatment approach consisting of preliminary annealing of the Sb layer before its selenization. The findings of this work demonstrate enhanced charge carriers' transportation, a stable performance, and an improvement of H2 generation from ...
Magno B. Costa   +7 more
wiley   +1 more source

Computing with Tangles

open access: yes, 2015
Tangles of graphs have been introduced by Robertson and Seymour in the context of their graph minor theory. Tangles may be viewed as describing "k-connected components" of a graph (though in a twisted way).
Grohe, Martin, Schweitzer, Pascal
core   +1 more source

Biodegradable and Recyclable Luminescent Mixed‐Matrix‐Membranes, Hydrogels, and Cryogels based on Nanoscale Metal‐Organic Frameworks and Biopolymers

open access: yesAdvanced Functional Materials, EarlyView.
The study presents biodegradable and recyclable mixed‐matrix membranes (MMMs), hydrogels, and cryogels using luminescent nanoscale metal‐organic frameworks (nMOFs) and biopolymers. These bio‐nMOF‐MMMs combine europium‐based nMOFs as probes for the status of the materials with the biopolymers agar and gelatine and present alternatives to conventional ...
Moritz Maxeiner   +4 more
wiley   +1 more source

Decomposition of Neutrosophic Zero-divisor graph [PDF]

open access: yesNeutrosophic Sets and Systems
Evaluating student performance in university English translation courses is a complex process that requires a comprehensive assessment of multiple factors.
Balakrishnan A   +3 more
doaj   +1 more source

Practical and Efficient Split Decomposition via Graph-Labelled Trees [PDF]

open access: yes, 2012
Split decomposition of graphs was introduced by Cunningham (under the name join decomposition) as a generalization of the modular decomposition. This paper undertakes an investigation into the algorithmic properties of split decomposition.
Corneil, Derek   +3 more
core  

Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts

open access: yes, 2015
Formulations of the Image Decomposition Problem as a Multicut Problem (MP) w.r.t. a superpixel graph have received considerable attention. In contrast, instances of the MP w.r.t.
Andres, Bjoern   +5 more
core   +2 more sources

Metal‐Organic Framework Embedded Electrospun Fibrous Membranes‐Based Hybrid Nanogenerators with Hierarchical Modified Polyamide Films for Mechanical Energy Harvesting and IoT Applications

open access: yesAdvanced Functional Materials, EarlyView.
Hybrid nanogenerator (HNG) based on a zinc‐metal‐organic framework‐loaded fibrous film integrated with a hierarchically modified nylon film having micropatterns and micropores is fabricated via an electrospinning technique, and its electrical properties are optimized. The HNGs are incorporated into wearable garments and automobile systems for practical
Sontyana Adonijah Graham   +6 more
wiley   +1 more source

Laser‐Induced Graphene from Waste Almond Shells

open access: yesAdvanced Functional Materials, EarlyView.
Almond shells, an abundant agricultural by‐product, are repurposed to create a fully bioderived almond shell/chitosan composite (ASC) degradable in soil. ASC is converted into laser‐induced graphene (LIG) by laser scribing and proposed as a substrate for transient electronics.
Yulia Steksova   +9 more
wiley   +1 more source

Connection and separation in hypergraphs

open access: yesTheory and Applications of Graphs, 2015
In this paper we study various fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. We prove a number of new results involving these concepts.
Mohammad Bahmanian, Mateja Sajna
doaj   +1 more source

Decomposition of Graphs on Surfaces

open access: yesJournal of Combinatorial Theory, Series B, 1997
For \(G= (V,E)\) an Eulerian graph imbedded on a triangulizable surface \(S\), \(\text{mincr}(G, D)\) denotes the minimum number of intersections of \(G\) and \(D'\) (counting multiplicities), where \(D'\) ranges over all closed curves freely homotopic to \(D\) and not intersecting \(V\).
de Graaf, M., Schrijver, A.
openaire   +4 more sources

Home - About - Disclaimer - Privacy