Results 221 to 230 of about 27,939 (295)

Evaluation of the Alterability of Natural and Artificial Agglomerated Stones Produced in Epoxy Matrix. [PDF]

Polymers (Basel)
Castilho EDF, Gadioli MCB, Aguiar MC, Marvila MT, Fontes Vieira CM, Monteiro SN, Azevedo ARG.   +6 more
europepmc   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

A quantitative measurement of dichoptic color difference thresholds related to binocular luster across various luminance. [PDF]

Iperception
Su J, Guan H, Chen Z.
europepmc   +1 more source

Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr, Lan Anh Pham, Cyril Pujol, Huan Zhou   +3 more
wiley   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Chromatic-Invariant Photothermal Fabrics Enabled by Narrow-Bandgap Organic Semiconductors for Wearable Solar Energy Harvesting. [PDF]

Adv Mater
Zhu J, Chen J, Liao S, Zheng J, Chen S, Wang Y, Wang X.   +6 more
europepmc   +1 more source

Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke, Gregory Gutin, Anders Yeo, Yacong Zhou   +3 more
wiley   +1 more source

An image-computable spatio-chromatic receptive field model of the midget retinal ganglion cell mosaic across the retina. [PDF]

J Comput Neurosci
Cottaris NP, Wandell BA, Brainard DH.
europepmc   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

A hybrid deep learning model for robust and efficient plant leaf disease detection using ResNet50, PCA, and SVM. [PDF]

Sci Rep
Begum S, E N, N N S.
europepmc   +1 more source