Results 51 to 60 of about 15,555,412 (284)
AKCE International Journal of Graphs and Combinatorics, 2023 The smallest integer k needed for the assignment of k colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph.
Jayabalan Geetha +2 more
doaj +1 more source
ON THE TOTAL CHROMATIC NUMBER OF ODD LINE GRAPHS OF ODD COMPLETE GRAPHS
Advances and Applications in Discrete MathematicsA total coloring of a graph entails the meticulous assignment of colors to both vertices and edges, ensuring that neither two adjacent vertices nor two adjacent edges receive the same color.
S. Thatchayani +2 more
semanticscholar +1 more source
Advanced Functional Materials, EarlyView.Ultra‐narrow green multi‐resonance thermally activated delayed fluorescence emitters have been developed by linear π‐extension strategy using tetracyclic naphtho[2,3‐b]benzofuran unit. The resulting phosphorescence‐sensitized OLEDs achieve a maximum external quantum efficiency of 37.7% in the bottom‐emitting architecture, while the complementary top ...
Eo Jin Jeon +7 more
wiley +1 more source
Algebraic Properties of Chromatic Polynomials and Their Roots [PDF]
, 2015 In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We relate algebraic properties of chromatic polynomials of graphs to structural properties of those graphs for some simple families of graphs.
Gilmore, Hamish Julian
core
High-speed chromatic dispersion monitoring of a two-channel WDM system using a single TPA microcavity [PDF]
, 2008 Chromatic dispersion monitoring of two 160 Gb/s wavelength channels using a TPA Microcavity is presented. As the microcavity exhibits a wavelength resonance characteristic, a single device could monitor a number of different WDM-channels ...
Guo, Wei Hua +7 more
core +2 more sources
General Vertex-Distinguishing Total Coloring of Graphs
Journal of Applied Mathematics, 2014 The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges.
Chanjuan Liu, Enqiang Zhu
doaj +1 more source
Adjacent Vertex Distinguishing Coloring of Fuzzy Graphs
Mathematics, 2023 In this paper, we consider the adjacent vertex distinguishing proper edge coloring (for short, AVDPEC) and the adjacent vertex distinguishing total coloring (for short, AVDTC) of a fuzzy graph.
Zengtai Gong, Chen Zhang
doaj +1 more source
The AVD-total chromatic number of fullerene molecular graphs
Discrete Mathematics & Theoretical Computer ScienceFinal version updated according to the journal (DMTCS) requirements, including corrected affiliations and layout adjustments. An \textit{AVD-$k$-total coloring} of a simple graph $G$ is a mapping $\pi:V(G) \cup E(G) \to \{1,\ldots,k\}$, with $k \geq 1 ...
M. D. da Cruz +3 more
semanticscholar +1 more source
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
Advanced 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
Chromatic roots are dense in the whole complex plane [PDF]
, 2004 I show that the zeros of the chromatic polynomials P-G(q) for the generalized theta graphs Theta((s.p)) are taken together, dense in the whole complex plane with the possible exception of the disc \q - l\ < l.
Sokal, AD
core