Results 51 to 60 of about 135,434 (260)
Locally identifying coloring in bounded expansion classes of graphs [PDF]
, 2012 A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct.
Gonçalves, Daniel +2 more
core +7 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
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
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
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
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
On Weakly Distinguishing Graph Polynomials
, 2019 A univariate graph polynomial P(G;X) is weakly distinguishing if for almost all finite graphs G there is a finite graph H with P(G;X)=P(H;X). We show that the clique polynomial and the independence polynomial are weakly distinguishing.
Makowsky, Johann A., Rakita, Vsevolod
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
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
Distant sum distinguishing index of graphs
, 2017 Consider a positive integer $r$ and a graph $G=(V,E)$ with maximum degree $\Delta$ and without isolated edges. The least $k$ so that a proper edge colouring $c:E\to\{1,2,\ldots,k\}$ exists such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$ for every ...
Przybyło, Jakub
core +1 more source