Results 81 to 90 of about 213,457 (302)
A DNA Computing Model for the Graph Vertex Coloring Problem Based on a Probe Graph
, 2018 The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as data in information processing grow exponentially with an increase of problem size.
Jin Xu +4 more
semanticscholar +1 more source
Bounded vertex coloring of trees
Discrete Mathematics, 2001 The \(k\)-bounded chromatic number, \(\chi _{k}(G),\) of a graph \(G\) is the minimum number of colors required to color the vertices of \(G\) such that no two vertices receive the same color and each color is assigned to at most \(k\) vertices. It is shown that \(\chi _{k}(T)\leq \left\lceil n/k\right\rceil +1\) for every tree \(T\). The authors state
Mark Jarvis, Bing Zhou 0004
openaire +2 more sources
Global Dominator Coloring of Graphs
Discussiones Mathematicae Graph Theory, 2019 Let S ⊆ V. A vertex v ∈ V is a dominator of S if v dominates every vertex in S and v is said to be an anti-dominator of S if v dominates none of the vertices of S. Let 𝒞 = (V1, V2, . . ., Vk) be a coloring of G and let v ∈ V (G).
Hamid Ismail Sahul, Rajeswari Malairaj
doaj +1 more source
Local antimagic vertex coloring of unicyclic graphs
Indonesian Journal of Combinatorics, 2018 The local antimagic labeling on a graph G with |V| vertices and |E| edges is defined to be an assignment f : E --> {1, 2,..., |E|} so that the weights of any two adjacent vertices u and v are distinct, that is, w(u)̸ ̸= w(v) where w(u) = Σe∈E(u) f(e ...
N. H. Nazula, S. Slamin, D. Dafik
semanticscholar +1 more source
Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity [PDF]
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2016 In the distributed message-passing setting a communication network is represented by a graph whose vertices represent processors that perform local computations and communicate over the edges of the graph.
Leonid Barenboim +2 more
semanticscholar +1 more source
Chiral Phase Change Nanomaterials
Advanced Functional Materials, EarlyView.This work demonstrates reversible, non‐volatile phase transitions in chiral Ge2${\rm Ge}_2$Sb2${\rm Sb}_2$Te5${\rm Te}_5$ (GST) nanohelices for high‐speed optical modulation of chirality and dynamic control of the state of polarization (SOP). The chiral nanostructures are fabricated using a highly directional, wafer‐scale physical vapor deposition ...
Joshua A. Burrow +11 more
wiley +1 more source
Vertex colorings with a distance restriction
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guantao Chen +2 more
openaire +2 more sources
Improved Bounds for Some Facially Constrained Colorings
Discussiones Mathematicae Graph Theory, 2023 A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a 2-connected plane graph is a proper
Štorgel Kenny
doaj +1 more source
Advanced Functional Materials, EarlyView.Durable quasi‐liquid polymer brush surfaces provide an anti‐scaling strategy for hypersaline brine evaporation and zero‐liquid‐discharge desalination. The smooth, liquid‐like QLS interface suppresses substrate‐side salt nucleation, promotes compact crystallization and dewetting, reduces crystal–surface contact area, and enables low‐adhesion salt ...
Mohammed Imran Khan, Bei Fan
wiley +1 more source
Nanoscale Spatial Tuning of Superconductivity in Cuprate Thin Films via Direct Laser Writing
Advanced Functional Materials, EarlyView.Maskless direct laser writing enables local control of oxygen stoichiometry in epitaxial YBCO thin films under ambient conditions. Sub‐micrometer grayscale patterns with tunable optical response and superconducting transport properties are achieved.
Irene Biancardi +11 more
wiley +1 more source