Results 101 to 110 of about 433,943 (319)
Some Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
, 2009 A greedy embedding of a graph $G = (V,E)$ into a metric space $(X,d)$ is a function $x : V(G) \to X$ such that in the embedding for every pair of non-adjacent vertices $x(s), x(t)$ there exists another vertex $x(u)$ adjacent to $x(s)$ which is closer to $
A. Kelmans +13 more
core +2 more sources
Advanced Engineering Materials, EarlyView.A hybrid system for de‐icing made of gradient polymer coatings, deposited on aluminum coupled with an electromechanical system, is demonstrated as an effective and durable strategy for reducing drastically ice adhesion. The system is capable of detaching ice blocks over the coating in less than 1 s, regardless of the ice type and covered area ...
Gabriel Hernández Rodríguez +8 more
wiley +1 more source
Fast simulation of planar Clifford circuits [PDF]
QuantumA general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally ...
David Gosset +3 more
doaj +1 more source
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Discussiones Mathematicae Graph Theory, 2020 Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao +2 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.Hydrostatic bearings excel in high‐precision applications, but their performance hinges on a continuous external supply. This study evaluates various material combinations for sliding surfaces to mitigate damage during supply failures or misalignment and to discover the most effective materials identified for enhancing the reliability and efficiency of
Michal Michalec +6 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
Regularity and Planarity of Token Graphs
Discussiones Mathematicae Graph Theory, 2017 Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G.
Carballosa Walter +3 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source
$1$-string $B_2$-VPG representation of planar graphs
Journal of Computational Geometry, 2016 In this paper, we prove that every planar graph has a 1-string $B_2$-VPG representation—a string representation using paths in a rectangular grid that contain at most two bends.
Therese Biedl, Martin Derka
doaj +1 more source
Deformation Behavior of La2O3‐Doped Copper during Equal Channel Angular Pressing
Advanced Engineering Materials, EarlyView.By additions of strengthening elements and/or structure optimization, the mechanical properties of copper can be increased while keeping favorable electric conductivity. By combining addition of La2O3 and processing by equal channel angular pressing, substructure development is achieved, leading to increase in microhardness to more than double the ...
Lenka Kunčická +2 more
wiley +1 more source