Results 61 to 70 of about 1,402,601 (292)
Equitable total chromatic number of splitting graph
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
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
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
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
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
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)
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
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
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
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

