Results 121 to 130 of about 200,785 (277)
Advanced Functional Materials, EarlyView.A Cu‐based crystal‐glass composite with high‐density twins is identified by a fast screening technique using combinatorial sputtering together with XRD and nanoindentation mapping. This bamboo‐like structure demonstrates homogenous plastic flow and retains high strength during in situ high temperature tests, up to 1 GPa at 550°C, owing to those ...
Chunhua Tian +10 more
wiley +1 more source
Three classes of 1-planar graphs
, 2014 A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs into three classes $\mathcal C_0, \mathcal C_1$ and $\mathcal C_2$ with respect to the types of crossings and present the decomposition of 1-planar join products.
Czap, J��lius, ��ugerek, Peter
openaire +3 more sources
Graphs cospectral with a friendship graph or its complement [PDF]
Transactions on Combinatorics, 2013 Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$.
Alireza Abdollahi +2 more
doaj
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Advanced Functional Materials, EarlyView.Reducing power consumption in spintronic memory remains a major challenge due to the need for high current densities. A bilayer of gadolinium and holmium iron garnets enables purely temperature‐induced, nonvolatile magnetic switching with bistable states within a ±25 K range. This approach achieves up to 66‐fold lower energy use than current spin–orbit
Junseok Kim +3 more
wiley +1 more source
On the k-Structure Ratio in Planar and Outerplanar Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj
A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings
, 2017 A plus-contact representation of a planar graph $G$ is called $c$-balanced if for every plus shape $+_v$, the number of other plus shapes incident to each arm of $+_v$ is at most $ c \Delta +O(1)$, where $\Delta$ is the maximum degree of $G$.
Biedl, Therese, Mondal, Debajyoti
core
Gourd‐Inspired Design of Unit Cell with Multiple Gradients for Physiological‐Range Pressure Sensing
Advanced Functional Materials, EarlyView.Gourd‐shaped micro‐dome arrays with coordinated modulus, conductivity, and geometric gradients co‐optimize sensitivity and linearity in piezoresistive tactile sensors. Under pressure, a solid upper dome embeds into a porous lower dome, triggering rapid contact‐area growth and series‐to‐parallel conduction, enabling unsaturated, intensity‐resolved ...
Jiayi Xu +6 more
wiley +1 more source
Straight-line drawings of 1-planar graphs
Computational GeometryA graph is 1-planar if it can be drawn in the plane so that each edge is crossed at most once. However, there are 1-planar graphs which do not admit a straight-line 1-planar drawing. We show that every 1-planar graph has a straight-line drawing with a two-coloring of the edges, so that edges of the same color do not cross.
openaire +2 more sources
Edge Coloring of Triangle-Free 1-Planar Graphs
, 2010 Please cite this paper as X. Zhang, G. Liu and J.-L. Wu. Edge coloring of triangle-free 1-planar graphs.
Zhang, Xin, Liu, Guizhen, Wu, Jianliang
openaire +3 more sources