Results 101 to 110 of about 1,814,953 (245)

Designing classes’ interfaces for neural network graph model

Труды Института системного программирования РАН, 2019
An approach to testing artificial neural networks is described. The model of neural network is based on graph theory, and operations that are used in theoretical works devoted to graphs, trees, paths, cycles, and circuits.
Yuri Leonidovich Karpov, Irina Anatolievna Volkova, Alexey Alexandrovich Vylitok, Leonid Evgenievich Karpov, Yuri Gennadievich Smetanin   +4 more
doaj   +1 more source

Skeletal graphs — a new class of perfect graphs

Discrete Mathematics, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the enumeration of a class of toroidal graphs

Contributions to Discrete Mathematics, 2018
We present enumerations of a class of toroidal graphs which are called semi-equivelar maps. Semi-equivelar maps are generalizations of equivelar maps. There are eight non-isomorphic types of semi-equivelar maps on the torus: {33,42}, {32,4,3,4}, {3,6,3,6}, {34,6}, {4,82}, {3,122}, {4,6,12}, {3,4,6,4}. We attempt to classify all these maps.
Ashish Kumar Upadhyay, Dipendu Maity
openaire   +4 more sources

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

Molecular Oncology, EarlyView.
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur, Joel Rodrigues Vitória, Manuel Saiselet, Ligia Craciun, Denis Larsimont, Anne Lefort, Frédérick Libert, Carine Maenhaut, Sabine Costagliola, Maxime Tarabichi, Mirian Romitti, Vincent Detours   +11 more
wiley   +1 more source

Pragmatic Graph Rewriting Modifications [PDF]

, 1999
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter, Vidal, Natalia, P.J. Rodgers, N. Vidal   +3 more
core   +1 more source

Leanness Computation: Small Values and Special Graph Classes [PDF]

Discrete Mathematics & Theoretical Computer Science
Let u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k.
David Coudert, Samuel Coulomb, Guillaume Ducoffe   +2 more
doaj   +1 more source

Cyclability in Graph Classes.

, 2019
A subset T subseteq V(G) of vertices of a graph G is said to be cyclable if G has a cycle C containing every vertex of T, and for a positive integer k, a graph G is k-cyclable if every subset of vertices of G of size at most k is cyclable. The Terminal Cyclability problem asks, given a graph G and a set T of vertices, whether T is cyclable, and the k ...
Crespelle, Christophe, Feghali, Carl, Golovach, Petr A.   +2 more
openaire   +4 more sources

Inhibition of cyclin‐dependent kinases 12/13 using CT7439 as a treatment for colorectal cancer with CDK12 upregulation

Molecular Oncology, EarlyView.
The proposed mechanism of action for the CDK12/13 inhibitor and cyclin K degrader, CT7439. CDK12/13 inhibition interrupts transcription elongation, leading to increased DNA damage that results in cell death. This agent is a potentially novel treatment option for patients with colorectal cancer. Created in BioRender. Cyclin‐dependent kinase (CDK) 12 and
Wylie K. Watlington, Divya L. Dayanidhi, Mohammad Zokaasadi, John B. Mantyh, Pelumi D. Olawuni, Gabrielle Rupprecht, Jeremy M. Force, Shannon McCall, Ashwani K. Bahl, David S. Hsu, Jason A. Somarelli   +10 more
wiley   +1 more source

On Distinct Inertias of Lanzhou Matrices Versus Adjacency Matrices in Some Graph Classes

Journal of Mathematics
The Lanzhou matrix is a recently introduced graph matrix that depends on the adjacency relation and on the degrees of each vertex in the graph and its complement, thereby providing a spectral perspective on graph structure that differs from the classical
Madhumitha K. V., Harshitha A., Swati Nayak, Sabitha D’Souza   +3 more
doaj   +1 more source

Total dominator chromatic number of a graph [PDF]

Transactions on Combinatorics, 2015
Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes.
Adel P. Kazemi
doaj