Results 51 to 60 of about 119,953 (318)
Chromatic polynomials of complements of bipartite graphs
, 2012 Bicliques are complements of bipartite graphs; as such each consists of two cliques joined by a number of edges. In this paper we study algebraic aspects of the chromatic polynomials of these graphs. We derive a formula for the chromatic polynomial of an
Bohn, Adam
core +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
On the total chromatic edge stability number and the total chromatic subdivision number of graphs [PDF]
Discrete Mathematics Letters, 2022 Arnfried Kemnitz, Massimiliano Marangio
doaj +1 more source
Grid Representations and the Chromatic Number [PDF]
, 2012 A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must intersect.
Balko, Martin
core +1 more source
Advanced Functional Materials, EarlyView.This study explores the benefits of metasurfaces made from functional materials, highlighting their ability to be adapted and improved for various high‐frequency applications, including communications and sensing. It first demonstrates the potential of these functional material‐based metasurfaces to advance the field of sub‐THz perceptive networks ...
Yat‐Sing To +5 more
wiley +1 more source
Distinguishing Chromatic Number of Random Cayley graphs
, 2016 The \textit{Distinguishing Chromatic Number} of a graph $G$, denoted $\chi_D(G)$, was first defined in \cite{collins} as the minimum number of colors needed to properly color $G$ such that no non-trivial automorphism $\phi$ of the graph $G$ fixes each ...
Balachandran, Niranjan +1 more
core +1 more source
Advanced Functional Materials, EarlyView.This review highlights how machine learning (ML) algorithms are employed to enhance sensor performance, focusing on gas and physical sensors such as haptic and strain devices. By addressing current bottlenecks and enabling simultaneous improvement of multiple metrics, these approaches pave the way toward next‐generation, real‐world sensor applications.
Kichul Lee +17 more
wiley +1 more source
The b-Chromatic Number of Star Graph Families
Le Matematiche, 2010 In this paper, we investigate the b-chromatic number of central graph, middle graph and total graph of star graph, denoted by C(K1,n), M(K1,n) and T(K1,n) respectively.
Vivin J. Vernold, M. Venkatachalam
doaj
Local total anti-magic chromatic number of graphs
Heliyon, 2023 Let G=(V,E) be a graph without isolated vertices and let |V(G)|=n and |E(G)|=m. A bijection π:V(G)∪E(G)→{1,2,....,n+m} is said to be local total anti-magic labeling of a graph G if it satisfies the conditions: (i.) for any edge uv, ω(u)≠ω(v), where u and
V. Sandhiya, M. Nalliah
doaj +1 more source