Results 91 to 100 of about 27,939 (295)
Algebraic Properties of Chromatic Polynomials and Their Roots
, 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
Interactions between luminance and colour signals : effects on shape
, 2013 This research was supported by the Engineering and Physical Sciences Research Council (EPSRC).Although luminance and color are thought to be processed independently at early stages of visual processing, there is evidence that they interact at later ...
Harris, Julie +2 more
core +1 more source
Journal of Symbolic Logic, 2008 AbstractWe show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [ℕ]ℕ, although its Borel chromatic number is ℵ0.
openaire +3 more sources
Nanoscale Spatial Organization of ARC High‐ and Low‐Order Assemblies at Excitatory Synapses
Advanced Science, EarlyView.ARC (Activity‐Regulated Cytoskeleton‐Associated protein) mediates synaptic plasticity by forming nanoscale assemblies in neurons. Using super‐resolution microscopy and time‐resolved anisotropy with targeted tagging, the study reveals low‐order ARC assemblies at synapses colocalizing with AMPARs, semi‐circular structures at endocytic zones, and 60–80 nm
Martina Damenti +13 more
wiley +1 more source
Some Equal Degree Graph Edge Chromatic Number
MATEC Web of Conferences, 2016 Let G(V, E) be a simple graph and k is a positive integer, if it exists a mapping of f, and satisfied with f(e1)≠6 = f(e2) for two incident edges e1,e2∉E(G), f(e1)≠6=f(e2), then f is called the k-proper-edge coloring of G(k-PEC for short).
Liu Jun +4 more
doaj +1 more source
Chromatic Number of Resultant of Fuzzy Graphs
Fuzzy Information and Engineering, 2016 Fuzzy graph coloring techniques are used to solve many complex real world problems. The chromatic number of complement of fuzzy graph is obtained and compared with the chromatic number of the corresponding fuzzy graph.
Anjaly Kishore, M.S. Sunitha
doaj +1 more source
Chromatic roots are dense in the whole complex plane
, 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
Chromatic numbers of algebraic hypergraphs [PDF]
Combinatorica, 2016 A k-uniform hypergraph is algebraic if its vertex set is n-dimensional Euclidean space, for some n, and its hyperedge set is defined from the zero set of some polynomial. The chromatic numbers of all algebraic hypergraphs are determined, provided they are infinite.
openaire +2 more sources
Shadow‐Calibrated Stereo Vision for Colorimetric Sweat Analysis
Advanced Science, EarlyView.By establishing a mathematical model that reconstructs 3D structures through geometric features of object shadows under controlled illumination, and combining it with Convolutional Neural Network‐based 2D image analysis for volumetric calibration, this work enables highly accurate 3D morphological reconstruction.
Ting Xiao +7 more
wiley +1 more source
Chromatic Number of Pseudo-Von neuman Regular Graph
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2020 Let R be a commutative ring , the pseudo – von neuman regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if , this graph denoted by
Nabeel E. Arif, Nermen J. Khalel
doaj +1 more source