Results 101 to 110 of about 3,864 (298)

On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs [PDF]

The Electronic Journal of Combinatorics, 2006
For a fixed graph $H$ on $k$ vertices, we investigate the graphs, $G$, such that for any partition of the vertices of $G$ into $k$ color classes, there is a transversal of that partition inducing $H$. For every integer $k\geq 1$, we find a family ${\cal F}$ of at most six graphs on $k$ vertices such that the following holds.
openaire   +2 more sources

A High‐Resolution THz‐PCF Sensing Framework: Precise Identification of Food Preservatives Through Refractive Index Analysis

Advanced Materials Interfaces, EarlyView.
As presented in the graphical abstract, it depicts an image of a terahertz photonic crystal fiber (THz‐PCF) sensor with a polygonal shape in the core, which is filled with an analyte, and air slots in the cladding. The THz waves will travel through the fiber, and due to increased light‐matter interaction in the sensing region, changes in refractive ...
T. H. M. Sumon Rashid, Md. Nayem Hossain, Md. Golam Kibria, A. H. M. Iftekharul Ferdous, Jabin Tasnin Upoma, Md. Lalon Hossain, Sajad Ali   +6 more
wiley   +1 more source

Weighted Partition Vertex and Edge Cover

CoRR
We study generalizations of the classical Vertex Cover and Edge Cover problems that incorporate group-wise coverage constraints. Our first focus is the \emph{Weighted Prize-Collecting Partition Vertex Cover} (WP-PVC) problem: given a graph with weights on both vertices and edges, and a partition of the edge set into $ω$ groups, the goal is to select a ...
Rajni Dabas, Samir Khuller, Emilie Rivkin   +2 more
openaire   +2 more sources

Vertex partition problems in digraphs

Anais do III Encontro de Teoria da Computação (ETC 2018), 2018
Let D be a digraph and k be a positive integer. Linial (1981) conjec tured that the k-norm of a k-minimum path partition of a digraph D is at most max{ΣC∈C |C| : C is a partial k-coloring of D}. Berge (1982) conjectured that every k-minimum path partition contains a partial k-coloring orthogonal to it.
M. Sambinelli, C. N. Lintzmayer, C. N. da Silva, O. Lee   +3 more
openaire   +2 more sources

High‐Power Rapid Laser‐Induced Synthesis of Multi‐functional Cobalt Metal‐Organic Framework With an Unprecedented Synthesis Efficiency

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, Bülend Ortaç, Ali Karatutlu, Taylan Gorkan, Engin Durgun, Dilek Soyler, Saniye Soylemez, Jelena Lillepäg, Volkan Filiz, Nergis Arsu, Sevil Savaskan Yilmaz   +10 more
wiley   +1 more source

Graphs obtained from collections of blocks

Electronic Journal of Graph Theory and Applications, 2015
Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially ...
Colton Magnant, Pouria Salehi Nowbandegani, Hua Wang   +2 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, Jan Petrš, Omar Aloui, Dario Floreano   +3 more
wiley   +1 more source

A characterisation of clique-width through nested partitions [PDF]

, 2015
International audienceClique-width of graphs is defined algebraically through operations on graphs with vertex labels. We characterise the clique-width in a combinatorial way by means of partitions of the vertex set, using trees of nested partitions ...
Courcelle, Bruno, Heggernes, Pinar, Papadopoulos, Charis, Rotics, Udi, Meister, Daniel   +4 more
core  

On s-harmonic functions on cones

Bruno Pini Mathematical Analysis Seminar, 2019
We deal with non negative functions which are s-harmonic on a given cone of the n-dimensional Euclidean space with vertex at zero, vanishing on the complementary.
Stefano Vita
doaj   +1 more source

A Whole‐Head Finite Element Model for Electrical Neuromodulation via Visual Brain‐Machine Interfaces

Advanced Science, EarlyView.
A multimodal, personalized head model is presented that integrates the entire visual pathway with surrounding tissues to simulate electrical stimulation of the optic nerve. In vivo validation in humans and goats, plus systematic component‐elimination analysis, demonstrates the high accuracy of the comprehensive model.
Shengjian Lu, Tonghe Yang, Yuan Geng, Huan Wu, Yangrui Huang, Te Zheng, Haodi Chen, Shurui Huang, Yi Cao, Jian Yang, Wentao Yan, Yikui Zhang, Wencan Wu   +12 more
wiley   +1 more source