Results 61 to 70 of about 1,402,601 (292)

Equitable total chromatic number of splitting graph

open access: yesProyecciones (antofagasta), 2019
Among the varius coloring of graphs, the concept of equitable total coloring of graph G is the coloring of all its vertices and edges in which the number of elements in any two color classes differ by atmost one.
G. Jayaraman   +2 more
semanticscholar   +1 more source

Rational Design of Organic Chromophores for Simultaneously Trig‐gering Redox Imbalance and Tracking Organelles in Biological Sys‐tems Under Near‐Infrared Light Irradiation

open access: yesAdvanced Healthcare Materials, EarlyView.
TOC represents the synthesis of theory‐guided novel near‐infrared (NIR) light‐absorbing organic photosensitizers (OPS) enabling redox‐induced tumor phototherapy and single‐cell organelle tracking. ABSTRACT The design of organic photosensitizers that operate efficiently in the near‐infrared (NIR) region remains challenging due to the need to balance ...
Pragti   +3 more
wiley   +1 more source

Effect of Barrel-to-Barrel Variation on Color and Phenolic Composition of a Red Wine

open access: yesFoods, 2021
Tangible variation of sensory characteristics is often observed in wine aged in similar barrels. Barrel-to-barrel variation in barrel-aged wines was investigated in respect of the most important phenolic compounds of oenological interest.
Leonard Pfahl   +4 more
doaj   +1 more source

The adjacent vertex distinguishing total chromatic number

open access: yesDiscrete Mathematics, 2012
A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is a colouring of both vertices and edges so that every pair of adjacent vertices receive different colours, every pair of adjacent edges receive different colours and every vertex and incident edge receive different colours.
Coker, Tom, Johannson, Karen R
openaire   +4 more sources

Equitable Total Chromatic Number of Kr×p for p Even

open access: yesLatin-American Algorithms, Graphs and Optimization Symposium, 2019
A total coloring is equitable if the number of elements colored by any two distinct colors differs by at most one. The equitable total chromatic number of a graph ( χ e ″ ) is the smallest integer for which the graph has an equitable total coloring. Wang
Anderson G. da Silva   +2 more
semanticscholar   +1 more source

Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application

open access: yesAdvanced Materials, EarlyView.
This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong   +12 more
wiley   +1 more source

Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)

open access: yesDiscussiones Mathematicae Graph Theory, 2013
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj   +1 more source

Recent results on the total chromatic number

open access: yesDiscrete Mathematics, 1993
The total chromatic number \(\chi_ T(G)\) of a graph \(G\) is the least number of colours needed to colour the vertices and edges of \(G\) so that no two adjacent or incident elements receive the same colour. In 1965, M. Behzad and V. G. Vizing independently made the following conjecture (known as the Total Colouring Conjecture, abbreviated as TCC ...
openaire   +1 more source

Neighbor sum distinguishing total chromatic number of 2-degenerate graphs

open access: yesDiscrete Applied Mathematics, 2018
Let G = ( V ( G ) , E ( G ) ) be a graph and ϕ be a proper total k -coloring of G by using the color set { 1 , 2 , … , k } . For any v ∈ V ( G ) , let f ( v ) = ∑ u v ∈ E ( G ) ϕ ( u v ) + ϕ ( v ) . The coloring ϕ is neighbor sum distinguishing, if f ( u
Changqing Xu, Shan Ge, Jianguo Li
semanticscholar   +1 more source

One‐Dimensional Materials Supported in Two‐Dimensional Van der Waals Metal–Organic Frameworks with Optical Anisotropy Switching via Twist‐Engineering

open access: yesAdvanced Materials, EarlyView.
We introduce a molecular strategy to assemble one‐dimensional (1D) materials into two‐dimensional (2D) van der Waals metal–organic frameworks (MOFs). Crystals of [FeX(pzX)(bpy)] (X = Cl, F) form anisotropic 2D layers that can be mechanically exfoliated into thin sheets.
Eleni C. Mazarakioti   +12 more
wiley   +1 more source

Home - About - Disclaimer - Privacy