Results 111 to 120 of about 125,344 (284)
On Graphs with Disjoint Dominating and 2-Dominating Sets
Discussiones Mathematicae Graph Theory, 2013 A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum ...
Henning Michael A., Rall Douglas F.
doaj +1 more source
, 2011 We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lov sz, Catlin, Kostochka and Rabern.
openaire +2 more sources
2K2 vertex-set partition into nonempty parts
Electronic Notes in Discrete Mathematics, 2008 Abstract A graph is 2K2-partitionable if its vertex set can be partitioned into four nonempty parts A, B, C, D such that each vertex of A is adjacent to each vertex of B, and each vertex of C is adjacent to each vertex of D. Determining whether an arbitrary graph is 2K2-partitionable is the only vertex-set partition problem into four nonempty parts ...
Simone Dantas +4 more
openaire +1 more source
Advanced Materials Technologies, EarlyView.Laser‐assisted synthesis enables rapid (within 1 h) and high‐yield (≥90%) production of Co‐MOFs with mesoporous structures, tunable magnetic and optical properties, and efficient adsorption of N2, CH4, and CO2 for low‐energy gas separation. DFT calculations elucidate the electronic structure and adsorption behavior.
Saliha Mutlu +10 more
wiley +1 more source
Advanced Materials Technologies, EarlyView.Here, it is shown that focused ion beam induced deposition (FIBID) using helium and neon ions enables advanced high‐resolution 3D nanoprinting achieving precise multimaterial architectures and engineered internal voids. Thus, FIBID with finely focused noble gas ion species is presented as a unique platform for designing functional nanomaterials for ...
Frances Isabel Allen
wiley +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
Advanced Optical Materials, EarlyView.An organic–inorganic mixed excited state is designed and demonstrated by combining the metal–metal and π–π interactions within a supramolecular Pt2–pyrene assembly. Directional orbital overlap between the Pt and carbon atoms gives rise to a long‐lived triplet emission, strong emission polarization, exciton–exciton annihilation, and efficient exciton ...
Ying Luo +7 more
wiley +1 more source
Topological Vertex for Symmetric matter
Journal of High Energy PhysicsWe propose a novel topological vertex formalism for 5d N = 1 $$ \mathcal{N}=1 $$ SU(N) gauge theory with a hypermultiplet in the symmetric tensor representation, whose Type IIB brane construction involves an NS5-brane attached to an O7+-plane.
Sung-Soo Kim +3 more
doaj +1 more source
3D‐Printing Aided Rapid Prototyping of Pretensioned Tensegrity Structures for Robotic Applications
Advanced Robotics Research, EarlyView.Printing, injection molding, and assembly (PMA) is a method for rapid prototyping mesoscale, topologically complex, and tensioned tensegrity structures. In combination with PMA method, two mold design strategies: modular mold and compact channel layout, enable efficiency and scalability for tensegrity fabrication.
Yi Sun +3 more
wiley +1 more source
Vertex Partitions and Maximum $\G$-free Subgraphs
, 2022 We define a $(V_1, V_2, \ldots, V_k)$-partition for a given graph $H$ and graphical properties $P_1, P_2, \ldots, P_k$ as a partition where each $V_i$ induces a subgraph of $H$ with property $P_i$. Matamala (2007) extended this result by showing that for any graph $H$ with $Δ(H)=p+q$, there exists a $(V_1, V_2)$-partition of $V(H)$ where $H[V_1]$ is a ...
openaire +2 more sources