Results 111 to 120 of about 27,939 (295)

Locating-Chromatic Number of Amalgamation of Stars

open access: yesJournal 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

Zero Knowledge and the Chromatic Number

open access: yesJournal of Computer and System Sciences, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uriel Feige, Joe Kilian
openaire   +2 more sources

Antenna Effect in Halogen‐Containing ZnSm Coordination Compounds: Utilizing Colorimetry for a Room‐Temperature Tunable Ratiometric Molecular Thermometer

open access: yesAdvanced Science, EarlyView.
The ZnSm‐Cl dinuclear molecular complex was synthesized through a simple one‐pot method. ZnL and Sm3+ exhibit complementary temperature‐dependent emission As the temperature increases, a noticeable color difference of ZnSm‐Cl can be observed within the room temperature range of 253‐333 K.
Ye Xia   +7 more
wiley   +1 more source

Chromatic number of Euclidean plane

open access: yes, 2023
If the chromatic number of Euclidean plane is larger than four, but it is known that the chromatic number of planar graphs is equal to four, then how does one explain it? In my opinion, they are contradictory to each other. This idea leads to confirm the
Wang, Kai-Rui
core  

Cucurbit[8]Uril Achieved Single‐Molecule Chiral Transfer to Supramolecular Circularly Polarized Luminescence

open access: yesAdvanced Science, EarlyView.
A single‐molecule cascade supramolecular system comprising L/D‐FPy, CB[8], and SC4AD serves as an efficient light‐harvesting platform. It facilitates cascade energy transfer and chiral transfer to acceptor dyes. Co‐assembly with a PVA matrix produces a multicolor solid film that exhibits enhanced luminescence dissymmetry factors (glum), enabling ...
Yongxue Li   +5 more
wiley   +1 more source

Multi‐Channel Electrically Tunable Varifocal Metalens With Compact Multilayer Polarization‐Dependent Metasurfaces and Liquid Crystals

open access: yesAdvanced Science, EarlyView.
A compact eight‐channel electrically tunable varifocal metalens with three single‐layer polarization‐multiplexed bi‐focal metalens and three LC cells. The total thickness of the device is ∼6 mm, while the focal lengths can be switched among eight values (3.6, 4.2, 4.5, 4.9, 6.2, 6.9, 8.4, and 9.6 mm). ABSTRACT As an essential module of optical systems,
Zhiyao Ma   +11 more
wiley   +1 more source

The Chromatic Number of Random Intersection Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
We study problems related to the chromatic number of a random intersection graph G (n,m, p). We introduce two new algorithms which colour G (n,m, p) with almost optimum number of colours with probability tending to 1 as n → ∞. Moreover we find a range of
Rybarczyk Katarzyna
doaj   +1 more source

The Local Chromatic Number

open access: yes, 2013
The local chromatic number ψ(G) of a graph G is a graph colouring parameter that is defined as ψ(G) = min c max v∈V (G) |c(Γ̄(v))| where the minimum is taken over all proper colourings c of G and Γ̄(v) denotes the closed neighbourhood of a vertex v.
Osang, Georg Fritz, Georg Osang
core  

A Soft Mechanoluminescent Skin for High‐Resolution Optical Tactile Sensing in Human–Machine Interaction

open access: yesAdvanced Science, EarlyView.
A soft mechanoluminescent tactile sensor that converts force directly into light is presented, enabling imaging‐based, wiring‐free touch sensing. By integrating a flexible ML‐skin with CMOS readout, the system achieves high sensitivity, fast response, and high spatial resolution, while maintaining structural simplicity and energy efficiency, offering a
Yu Feng   +11 more
wiley   +1 more source

The 2-Distance Chromatic Number of Some Wheel Related Graphs

open access: yes, 2018
Let ( )EVG , be a simple and connected graph of vertex set V and edge set E. By the 2-distance chromatic number of a graph G, we mean a map ( ) { }k c GV ,1 ,2 ,3 ..., : → such that any two vertices at distance at most two from ...
KRISTIANA, Arika Indah   +3 more
core  

Home - About - Disclaimer - Privacy