Results 61 to 70 of about 9,612,020 (345)
The Locating Chromatic Number of Book Graph
Journal of Mathematics, 2021 Let G=VG,EG be a connected graph and c:VG⟶1,2,…,k be a proper k-coloring of G. Let Π be a partition of vertices of G induced by the coloring c. We define the color code cΠv of a vertex v∈VG as an ordered k-tuple that contains the distance between each ...
Nur Inayah +2 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Controlled syntheses of lanthanide coordination polymers based on the dihydroxybenzoquinone (DHBQ) organic linker afforded large single crystals of Ln‐DHBQ CPs (Ln = Yb, Nd). A novel structural variant of Yb‐DHBQ is identified by means of single crystal diffraction analysis.
Marina I. Schönherr +7 more
wiley +1 more source
Locating Chromatic Number of Powers of Paths and Cycles
Symmetry, 2019 Let c be a proper k-coloring of a graph G. Let π = { R 1 , R 2 , … , R k } be the partition of V ( G ) induced by c, where R i is the partition class receiving color i.
Manal Ghanem, H. Al-Ezeh, A. Dabbour
semanticscholar +1 more source
More on the total dominator chromatic number of a graph [PDF]
Journal of Information and Optimization Sciences, 2017 Let G be a simple graph. A total dominator coloring of G, is a proper coloring of the vertices of G in which each vertex of the graph is adjacent to every vertex of some color class.
Nima Ghanbari, S. Alikhani
semanticscholar +1 more source
DENTA: A Dual Enzymatic Nanoagent for Self‐Activating Tooth Whitening and Biofilm Disruption
Advanced Functional Materials, EarlyView.The nanoapatite with dual enzymes (DENTA) accumulates in dentinal tubules, reducing hypersensitivity caused by dental nerve exposure and facilitating continuous ROS generation through salivary glucose for effective, long‐term whitening. The dentin structures remain non‐destructive due to the low concentration of ROS, demonstrating excellent cell ...
Junseok Kim +13 more
wiley +1 more source
Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths [PDF]
Electronic Journal of Combinatorics, 2017 We prove that for all nonnegative integers k,s there exists c with the following property. Let G be a graph with clique number at most k and chromatic number more than c.
A. Scott, P. Seymour
semanticscholar +1 more source
Hamiltonian Chromatic Number of Trees [PDF]
, 2020 This is a final version appeared in proceedings of RAGT 2019 ...
Bantva, Devsi, Vaidya, Samir
openaire +2 more sources
Advanced Functional Materials, EarlyView.This review explores functional and responsive materials for triboelectric nanogenerators (TENGs) in sustainable smart agriculture. It examines how particulate contamination and dirt affect charge transfer and efficiency. Environmental challenges and strategies to enhance durability and responsiveness are outlined, including active functional layers ...
Rafael R. A. Silva +9 more
wiley +1 more source
Chromatic Numbers of Simplicial Manifolds [PDF]
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, 2019 Higher chromatic numbers $χ_s$ of simplicial complexes naturally generalize the chromatic number $χ_1$ of a graph. In any fixed dimension $d$, the $s$-chromatic number $χ_s$ of $d$-complexes can become arbitrarily large for $s\leq\lceil d/2\rceil$ [6,18].
Frank H. Lutz, Jesper M. Møller
openaire +5 more sources
Advanced Functional Materials, EarlyView.Multicolor optoelectronic synapses are realized by vertically integrating solution‐processed MoS2 thin‐film and SWCNT. The electronically disconnected but interactive MoS2 enables photon‐modulated remote doping, producing a bi‐directional photoresponse.
Jihyun Kim +8 more
wiley +1 more source