Results 91 to 100 of about 27,017 (285)
On the Density of Maximal 1-Planar Graphs [PDF]
, 2013 A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. It is maximal 1-planar if the addition of any edge violates 1-planarity. Maximal 1-planar graphs have at most 4n−8 edges. We show that there are sparse maximal 1-planar graphs with only $\frac{45}{17} n + \mathcal{O}(1)$ edges.
Franz J. Brandenburg +5 more
openaire +1 more source
Advanced 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
Advanced 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
On Independent Domination in Planar Cubic Graphs
Discussiones Mathematicae Graph Theory, 2019 A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S.
Abrishami Gholamreza +2 more
doaj +1 more source
Laser‐Induced Graphene from Waste Almond Shells
Advanced 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
Strong Chromatic Index Of Planar Graphs With Large Girth
Discussiones Mathematicae Graph Theory, 2014 Let Δ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree Δ and girth at least 1 Δ+46 is strong (2Δ−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of ...
Jennhwa Chang Gerard +3 more
doaj +1 more source
Acyclic Chromatic Index of Triangle-free 1-Planar Graphs [PDF]
, 2017 Jijuan Chen, Tao Wang, Zhang Huiqin
openalex +1 more source
Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs [PDF]
, 2020 Christine Dahn +3 more
openalex +1 more source
Double Helical Plasmonic Antennas
Advanced Functional Materials, EarlyView.Plasmonic double helical antennas funnel circularly polarized light to the nanoscale, offering strong chiroptical interaction and directional light emission. Extending a single helix design tool, this study combines numerical modeling with experimental validation, revealing large, broadband dissymmetry factors in the visible range.
Aleksei Tsarapkin +7 more
wiley +1 more source
Strong oriented chromatic number of planar graphs without short cycles
Discrete Mathematics & Theoretical Computer Science, 2008 Let M be an additive abelian group. A strong oriented coloringof an oriented graph G is a mapping φ from V(G) to M such that (1) φ(u) ≠ φ(v) whenever uv is an arc in G and (2) φ(v) - φ(u) ≠ -(φ(t) - φ(z)) whenever uv and zt are two arcs in
Mickaël Montassier +2 more
doaj