Results 41 to 50 of about 16,459 (227)
Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
Journal of Mathematical Study, 2023 Summary: For a given simple graph \(G = (V(G),E(G)),\) a proper total-\(k\)-coloring \(c : V(G) \cup E(G) \rightarrow \{1,2,\dots,k\}\) is neighbor sum distinguishing if \(f(u) \neq f(v)\) for each edge \(uv \in E(G)\), where \(f(v) = \Sigma_{wv \in E(G)} c(wv)+c(v)\).
Huang, Danjun, Bao, Dan
openaire +2 more sources
Local chromatic number and distinguishing the strength of topological obstructions [PDF]
Transactions of the American Mathematical Society, 2008 The local chromatic number of a graph G G is the number of colors appearing in the most colorful closed neighborhood of a vertex minimized over all proper colorings of G G . We show that two specific topological obstructions that have the same implications for the chromatic number have different implications for the ...
Simonyi, Gábor +2 more
openaire +3 more sources
Zhejiang Daxue xuebao. Lixue ban, 2017 A proper k-edge coloring of a graph G is an assignment of k colors 1, 2, …, k to edges of G such that any two adjacent edges receive the different colors.
WANGGuoxing(王国兴)
doaj +1 more source
Boxicity and Cubicity of Product Graphs
, 2013 The 'boxicity' ('cubicity') of a graph G is the minimum natural number k such that G can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel unit cubes) in $R^k$.
Chandran, L. Sunil +3 more
core +1 more source
Advanced Functional Materials, EarlyView.Liquid‐phase transmission electron microscopy enables direct observation of nucleation and growth processes in solution. This review is dedicated to the remembrance of Helmut Cölfen and highlights recent studies on complex materials—oxides, biominerals, organic–inorganic crystals—which were central to his research activity. It summarizes key milestones,
Charles Sidhoum +5 more
wiley +1 more source
List Distinguishing Parameters of Trees [PDF]
, 2011 A coloring of the vertices of a graph G is said to be distinguishing} provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D(G), is the minimum number of colors in a distinguishing coloring of G ...
Ferrara, Michael +4 more
core +1 more source
Advanced Functional Materials, EarlyView.Cephalopod‐inspired photonic microparticles with dynamic structural coloration are fabricated via confined self‐assembly of linear block copolymers into ellipsoids containing stacked lamellae. Embedded superparamagnetic nanoparticles enable rapid magnetic alignment, restoring vivid, angle‐dependent color.
Gianluca Mazzotta +8 more
wiley +1 more source
Advanced Functional Materials, EarlyView.The citric acid/urea (CA‐Urea) precursor system offers a versatile, scalable route to carbon dots with tunable luminescence and multifunctionality. Mechanistic insights into precursor chemistry and reaction parameters have enabled doping, surface modification, and hybridization strategies, yielding CDs for luminescent devices, sensing, catalysis ...
Yupeng Liu +10 more
wiley +1 more source
The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
Electronic Journal of Graph Theory and Applications, 2022 23 pages, 1 ...
Grant Fickes, Wing Hong Tony Wong
openaire +2 more sources
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