Results 111 to 120 of about 380,403 (285)
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
Advanced Functional Materials, EarlyView.Ultrathin, flexible neural probes are developed with an innovative, biomimetic design incorporating brain tissue‐compatible materials. The material system employs biomolecule‐based encapsulation agents to mitigate inflammatory responses, as demonstrated through comprehensive in vitro and in vivo studies.
Jeonghwa Jeong +7 more
wiley +1 more source
On the Book Thickness of 1-Planar Graphs [PDF]
arXiv, 2015 In a book embedding of a graph G, the vertices of G are placed in order along a straight-line called spine of the book, and the edges of G are drawn on a set of half-planes, called the pages of the book, such that two edges drawn on a page do not cross each other. The minimum number of pages in which a graph can be embedded is called the book-thickness
arxiv
The S-rule and 1-d representation for the traversal of a planar graph in AEC industry
, 2023 Luxin Luo, Sida Kong
openalex +2 more sources
Wearable Haptic Feedback Interfaces for Augmenting Human Touch
Advanced Functional Materials, EarlyView.The wearable haptic feedback interfaces enhance user experience in gaming, social media, biomedical instrumentation, and robotics by generating tactile sensations. This review discusses and categorizes current haptic feedback interfaces into force, thermal, and electrotactile stimulation‐based haptic feedback interfaces, elucidating their current ...
Shubham Patel +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
Time‐Controlled Dual Targeting to Program Systemic and Intercellular Transfer of Therapeutic Effects
Advanced Functional Materials, EarlyView.Aspirin‐liposomes loaded onto monocytes enable inflammation‐triggered targeting and efficient hand‐over of aspirin to inflamed cells. Monocytes uptake a significant portion of aspirin‐liposomes, prolonging therapeutic action. This approach enhances anti‐inflammatory effects through intercellular transfer, demonstrating a translational strategy for ...
Seung Eun Yu +6 more
wiley +1 more source
Dynamic list coloring of 1-planar graphs [PDF]
arXiv, 2019 A graph is $k$-planar if it can be drawn in the plane so that each edge is crossed at most $k$ times. Typically, the class of 1-planar graphs is among the most investigated graph families within the so-called "beyond planar graphs". A dynamic $\ell$-list coloring of a graph is a proper coloring so that each vertex receives a color from a list of $\ell$
arxiv
Optical Hydrogen Sensing Materials for Applications at Sub‐Zero Temperatures
Advanced Functional Materials, EarlyView.This study demonstrates the viability of optical hydrogen sensors at temperatures as low as −60°C. Using advanced metal hydride materials, the sensors detect hydrogen with high sensitivity, speed, and stability across a wide range of concentrations. These findings open doors for safe hydrogen detection in extreme cold, enabling applications in aviation,
Ziqing Yuan +4 more
wiley +1 more source