Results 61 to 70 of about 3,864 (298)
The orbifold topological vertex [PDF]
, 2012 We develop a topological vertex formalism for computing the Donaldson–Thomas invariants of Calabi–Yau orbifolds. The basic combinatorial object is the orbifold vertex VλμνG, a generating function for the number of 3D partitions asymptotic to 2D ...
Bryan, Jim +5 more
core +1 more source
Some Observations on the Smallest Adjacency Eigenvalue of a Graph
Discussiones Mathematicae Graph Theory, 2020 In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are based on Rayleigh
Cioabă Sebastian M. +2 more
doaj +1 more source
Advanced Healthcare Materials, EarlyView.This review examines how cellular behavior is regulated by mechanical cues transmitted through soft biomaterials, from single‐cell mechanosensing to tissue‐level adaptation. It highlights why physiological relevance, rather than model complexity alone, is critical for translational mechanobiology and introduces a scoring framework linking material ...
Mathias Polz +9 more
wiley +1 more source
Uniform Partitions of 3-space, their Relatives and Embedding [PDF]
, 2000 We review 28 uniform partitions of 3-space in order to find out which of them have graphs (skeletons) embeddable isometrically (or with scale 2) into some cubic latticeZn.
Shtogrin, Mikhail +3 more
core +1 more source
Tree Centroid Properties Clarification
Моделирование и анализ информационных систем, 2017 The paper is devoted to the tree centroid properties clarification. Attention of the authors was attracted by the popular problem of (binary) partition of a graph. The solution is known only by brute force algorithm.
Yurii A. Belov, Sergei I. Vovchok
doaj +1 more source
Vertex partitioning of a class of digraphs [PDF]
Mathématiques et sciences humaines, 2002 A vertex subset V' of a digraph is a pseudo sink set if its out-degree is low. The research of a pseudo sink set in a digraph is a high complexity combinatory problem. We show, for a particular family of digraphs, that a clustering of the vertex set fitted with a well chosen metric allows to reveal pseudo sink sets by their aggregation in a first ...
Louis Ferre, Bertrand Jouve
openaire +1 more source
Kelvin Probe Force Microscopy in Bionanotechnology: Current Advances and Future Perspectives
Advanced Materials, EarlyView.Kelvin probe force microscopy (KPFM) enables the nanoscale mapping of electrostatic surface potentials. While widely applied in materials science, its use in biological systems remains emerging. This review presents recent advances in KPFM applied to biological samples and provides a critical perspective on current limitations and future directions for
Ehsan Rahimi +4 more
wiley +1 more source
Characterizing block graphs in terms of their vertex-induced partitions [PDF]
, 2016 Block graphs are a generalization of trees that arise in areas such as metric graph theory, molecular graphs, and phylogenetics. Given a finite connected simple graph $G=(V,E)$ with vertex set $V$ and edge set $E\subseteq \binom{V}{2}$, we will show that
Moulton, Vincent +4 more
core
Polychromatic colorings of arbitrary rectangular partitions [PDF]
, 2010 A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex 4-colorings of general partitions where every subrectangle is required to have all four colors appear on
Keszegh, Balázs +11 more
core +1 more source
Planarity of Overlapping Clusterings Including Unions of Two Partitions
Journal of Graph Algorithms and Applications, 2017 We consider clustered planarity with overlapping clusters as introduced by Didimo et al. (Didimo, Giordano, Liotta, JGAA, 2008). It can be deduced from a proof in Athenstädt et al. (J. C. Athenstädt, T. Hartmann, and M.
Jan Christoph Athenstädt +1 more
doaj +1 more source