Results 41 to 50 of about 1,157,203 (300)
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
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
Density decompositions of networks
Journal of Graph Algorithms and Applications, 2019 We introduce a new topological descriptor of a graph called the density decomposition which is a partition of the vertices of a graph into regions of uniform density.
Glencora Borradaile +2 more
doaj +1 more source
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 +11 more
wiley +1 more source
Graph products of groups [PDF]
, 1990 In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups.
Green, E.R, Green, Elisabeth Ruth
core +6 more sources
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 +4 more sources
Molecular Oncology, EarlyView.Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source
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
, 2011 In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +1 more source