Results 81 to 90 of about 1,207,649 (297)
Average properties of combinatorial problems and thermodynamics of spin models on graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The study of thermodynamic properties of classical spin models on infinite graphs naturally leads to consider the new combinatorial problems of random-walks and percolation on the average.
Alessandro Vezzani +2 more
doaj +1 more source
A graph discretization of the Laplace–Beltrami operator [PDF]
Journal of Spectral Theory, 2015 We show that eigenvalues and eigenfunctions of the Laplace–Beltrami operator on a Riemannian manifold are approximated by eigenvalues and eigenvectors of a (suitably weighted) graph Laplace operator of a proximity graph on an epsilon-net.
Burago, D, Ivanov, S, Kurylev, Y
openaire +4 more sources
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
Configuration‐Encoded Cell Alignment by Light‐Gated Silicon Photovoltaic Microcell Arrays
Advanced Functional Materials, EarlyView.Light‐gated silicon photovoltaic microcells convert pulsed illumination into localized electrical cues. Arranging otherwise similar microcells into four‐lobed, six‐lobed, or circular patterns directs fibroblasts into corresponding local arrangements without wired stimulation.
Yifan Tao +7 more
wiley +1 more source
Relating 2-Rainbow Domination To Roman Domination
Discussiones Mathematicae Graph Theory, 2017 For a graph G, let R(G) and yr2(G) denote the Roman domination number of G and the 2-rainbow domination number of G, respectively. It is known that yr2(G) ≤ R(G) ≤ 3/2yr2(G). Fujita and Furuya [Difference between 2-rainbow domination and Roman domination
Alvarado José D. +2 more
doaj +1 more source
A global reduction method for multidimensional size graphs
, 2006 This paper introduces the concept of discrete multidimensional size function, a mathematical tool that studies particular graphs called size graphs.
A. CERRI +8 more
core +1 more source
Molecular Bridges for 2D Nanomaterials
Advanced Functional Materials, EarlyView.Molecular cross‐linking provides a versatile strategy to engineer interfaces in 2D materials. By tuning the linker backbone, binding mode, and interflake spacing, molecular bridges can regulate charge transport, mechanical integrity, chemical functionality, and processing.
Yudhajit Bhattacharjee +3 more
wiley +1 more source
Consensus Strategies for Signed Profiles on Graphs [PDF]
The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for
Changat, M. +3 more
core
Loop Graphs And Asteroidal Sets
, 2015 [No abstract available]22179183Alcón, L., de Figueiredo, C.H., Cerioli, M., Gutierrez, M., Meidanis, J., Tree Loop Graphs (2004) Electronic Notes in Discrete Mathematics, 18, pp. 17-23.
Alcon L. +4 more
core +1 more source