Results 81 to 90 of about 117,877 (279)
The $b$-Chromatic Number and $f$-Chromatic Vertex Number of Regular Graphs
, 2013 The $b$-chromatic number of a graph $G$, denoted by $b(G)$, is the largest positive integer $k$ such that there exists a proper coloring for G with $k$ colors in which every color class contains at least one vertex adjacent to some vertex in each of the other color classes, such a vertex is called a dominant vertex. The $f$-chromatic vertex number of a
El-Sahili, Amine +3 more
openaire +4 more sources
Two‐Dimensional Reconfigurable Photodiode for In‐Sensor Color Filtering and Spectral Logic
Advanced Materials, EarlyView.By harnessing the photodoping of different aggregates, the device exhibits wavelength‐dependent volatile‐to‐nonvolatile photoresponses that can be reconfigured via bias modulation. This enables in‐sensor color filtering and spectral‐encrypted information processing, eliminating reliance on external optical filters or post‐processing algorithms ...
Xiaokun Guo +7 more
wiley +1 more source
The Incidence Chromatic Number of Toroidal Grids
Discussiones Mathematicae Graph Theory, 2013 An incidence in a graph G is a pair (v, e) with v ∈ V (G) and e ∈ E(G), such that v and e are incident. Two incidences (v, e) and (w, f) are adjacent if v = w, or e = f, or the edge vw equals e or f.
Sopena Éric, Wu Jiaojiao
doaj +1 more source
Advanced Materials Technologies, EarlyView.This study presents a novel platform for assessing the active mechanical behavior of living cardiac microbundles through localized nanoindentation, integrated with temperature regulation and dual‐camera imaging systems. The developed system enables quantitative evaluation of dynamic micromechanics in engineered cardiac tissues in vitro, offering ...
Lihua Lou +4 more
wiley +1 more source
Some Equal Degree Graph Edge Chromatic Number
MATEC Web of Conferences, 2016 Let G(V, E) be a simple graph and k is a positive integer, if it exists a mapping of f, and satisfied with f(e1)≠6 = f(e2) for two incident edges e1,e2∉E(G), f(e1)≠6=f(e2), then f is called the k-proper-edge coloring of G(k-PEC for short).
Liu Jun +4 more
doaj +1 more source
Advanced Optical Materials, EarlyView.Structural color generation is an emerging field for digital display and printing applications. This report presents a novel truncated‐cone design and the first use of GaP sandwiched between two layers of TiO2, demonstrating ultra‐bright, tunable colors with a record color gamut.
Md Rumon Miah +2 more
wiley +1 more source
Locating-Chromatic Number of Amalgamation of Stars
Journal of Mathematical and Fundamental Sciences, 2013 Let G be a connected graph and c a proper coloring of G . For i Æ’1,2,Æ’»,k define the color class i C as the set of vertices receiving color i . The color code c (v) "ž¨ of a vertex v in G is the ordered k -tuple 1 ( ( , ), , ( , )) k d v C Æ’» d v C ...
Asmiati Asmiati +2 more
doaj +1 more source
TacScope: A Miniaturized Vision‐Based Tactile Sensor for Surgical Applications
Advanced Robotics Research, EarlyView.TacScope is a compact, vision‐based tactile sensor designed for robot‐assisted surgery. By leveraging a curved elastomer surface with pressure‐sensitive particle redistribution, it captures high‐resolution 3D tactile feedback. TacScope enables accurate tumor detection and shape classification beneath soft tissue phantoms, offering a scalable, low‐cost ...
Md Rakibul Islam Prince +3 more
wiley +1 more source
Modular chromatic number of $C_m square P_n$ [PDF]
Transactions on Combinatorics, 2013 A modular $k$-coloring, $kge 2,$ of a graph $G$ without isolated vertices is a coloring of the vertices of $G$ with the elements in $mathbb{Z}_k$ having the property that for every two adjacent vertices of $G,$ the sums of the colors of the neighbors are
N. Paramaguru, R. Sampathkumar
doaj