Results 51 to 60 of about 121,460 (194)
Advanced Science, EarlyView.Stochastic nanoscale physical cues induce glioblastoma (GBM)‐associated transcriptional traits in naïve astrocytes leading to spontaneous formation of spheroids. Cells within spheroids express activated‐MMP2 and a differential gene expression pattern involving P53 and NOTCH3, providing evidence for a role for changes in brain topography, as observed in
Laurent Starck +8 more
wiley +1 more source
Genus of total graphs from rings: A survey
AKCE International Journal of Graphs and Combinatorics, 2018 Let be a commutative ring. The total graph of is the undirected graph with vertex set and two distinct vertices and are adjacent if is a zero divisor in In this paper, we present a survey of results on the genus of and three of its generalizations.
T. Tamizh Chelvam, T. Asir
doaj +2 more sources
مجلة بغداد للعلوم, 2018 A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite,
Baghdad Science Journal
doaj +1 more source
Adding Perspective to the Bibliometric Mapping Using Bidirected Graph
Open Information Science, 2023 Bibliometric mapping offers easiness in analyzing the relationship between publications through the network visuals created. Several applications, such as VOSviewer, Bibliometrix, and CiteSpace, make conducting network analysis more convenient. Moreover,
Santosa Faizhal Arif
doaj +1 more source
Breaking Symmetries in Graph Representation [PDF]
, 2013 There are many complex combinatorial problems which involve searching for an undirected graph satisfying a certain property. These problems are often highly challenging because of the large number of isomorphic representations of a possible solution.
Codish, M. +3 more
core
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
, 2017 Depth first search (DFS) tree is a fundamental data structure for solving graph problems. The classical algorithm [SiComp74] for building a DFS tree requires $O(m+n)$ time for a given graph $G$ having $n$ vertices and $m$ edges. Recently, Baswana et al. [
Khan, Shahbaz
core +1 more source
The Guessing Number of Undirected Graphs [PDF]
The Electronic Journal of Combinatorics, 2011 Riis [Electron. J. Combin., 14(1):R44, 2007] introduced a guessing game for graphs which is equivalent to finding protocols for network coding. In this paper we prove upper and lower bounds for the winning probability of the guessing game on undirected graphs.
Christofides, Demetres, Markström, Klas
openaire +2 more sources
Unveil Fundamental Graph Properties for Neural Architecture Search
Advanced Science, EarlyView.This paper proposes NASGraph, a graph‐based framework that represents neural architectures as graphs whose structural properties determine performance. By revealing structure–performance relationships, NASGraph enables efficient neural architecture search with significantly reduced computation.
Zhenhan Huang +4 more
wiley +1 more source
Multimodal Cross‐Attentive Graph‐Based Framework for Predicting In Vivo Endocrine Disruptors
Advanced Science, EarlyView.A multimodal cross‐attentive graph neural network integrates molecular graphs with androgen and estrogen adverse outcome pathway (AOP)–anchored in vitro assay signals to predict in vivo endocrine disruption. By fusing information on Tier‐1 AOP logits with chemical structures, the framework achieves high accuracy and provides assay‐traceable ...
Eder Soares de Almeida Santos +6 more
wiley +1 more source
Graph isomorphism—Characterization and efficient algorithms
High-Confidence ComputingThe Graph isomorphism problem involves determining whether two graphs are isomorphic and the computational complexity required for this determination. In general, the problem is not known to be solvable in polynomial time, nor to be NP-complete.
Jian Ren, Tongtong Li
doaj +1 more source