Results 41 to 50 of about 58,065 (305)
Detour self-decomposition of corona product of graphs
Ratio Mathematica, 2023 Decomposition of a graph G is the collection of edge-disjoint subgraphs of G. The longest distance between any two vertices of G is its detour distance.
E Ebin Raja Merly, E Anlin Bena
doaj +1 more source
Graph decomposition and parity
J. Graph Theory, 2012 Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a sufficient condition for this distribution to tend to uniform modulo $q$. We determine the asymptotic distribution of
Bobby DeMarco, Amanda Redlich
openaire +2 more sources
Graph Regularized Tensor Decomposition for Recommender Systems
, 2022 Humans make decisions when presented with choices based on influences. The Internet today presents people with abundant choices to choose from. Recommending choices with an emphasis on people's preferences has become increasingly sought.
Chandrashekar, Rohan (author)
core
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source
Density-friendly Graph Decomposition [PDF]
, 2015 Decomposing a graph into a hierarchical structure via k-core analysis is a standard operation in any modern graph-mining toolkit. k-core decomposition is a simple and efficient method that allows to analyze a graph beyond its mere de-gree distribution ...
Nikolaj Tatti, Aristides Gionis
core +1 more source
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yair Caro, Raphael Yuster
openaire +2 more sources
Molecular Oncology, EarlyView.BCL9 and BCL9L drive bladder cancer progression by enhancing β‐catenin signaling, promoting proliferation, migration, invasion, and organoid growth. Genetic depletion of BCL9(L) suppresses malignant phenotypes, while pharmacological disruption of the β‐catenin/BCL9(L) complex with ZW4864 inhibits canonical Wnt signaling and tumor‐associated cellular ...
Roland Kotolloshi +11 more
wiley +1 more source
Decompositions of triangle-dense graphs [PDF]
Proceedings of the 5th conference on Innovations in theoretical computer science, 2014 High triangle density -- the graph property stating that a constant fraction of two-hop paths belong to a triangle -- is a common signature of social networks. This paper studies triangle-dense graphs from a structural perspective. We prove constructively that significant portions of a triangle-dense graph are contained in a disjoint union of dense ...
Rishi Gupta +2 more
openaire +3 more sources
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
Odd Decompositions of Eulerian Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2017 We prove that an eulerian graph $G$ admits a decomposition into $k$ closed trails of odd length if and only if and it contains at least $k$ pairwise edge-disjoint odd circuits and $k\equiv |E(G)|\pmod{2}$. We conjecture that a connected $2d$-regular graph of odd order with $d\ge 1$ admits a decomposition into $d$ odd closed trails sharing a common ...
Edita Mácajová, Martin Skoviera
openaire +2 more sources