Results 31 to 40 of about 982,672 (306)
Neuroplasticity and MRI: A perfect match [PDF]
NeuroImage, 2016 Numerous studies have illustrated the benefits of physical workout and cognitive exercise on brain function and structure and, more importantly, on decelerating cognitive decline in old age and promoting functional rehabilitation following injury. Despite these behavioral observations, the exact mechanisms underlying these neuroplastic phenomena remain
Julie Hamaide +2 more
openaire +4 more sources
Erdős matching conjecture for almost perfect matchings
Discrete Mathematics, 2023 In 1965 Erdős asked, what is the largest size of a family of $k$-element subsets of an $n$-element set that does not have a matching of size $s+1$? In this note, we improve upon a recent result of Frankl and resolve this problem for $s>101k^{3}$ and $(s+1)k\le n<(s+1)(k+\frac{1}{100k})$.
Dmitriy Kolupaev, Andrey Kupavskii
openaire +3 more sources
哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)
Zhejiang Daxue xuebao. Lixue ban, 2009 Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj +1 more source
Two short proofs of the Perfect Forest Theorem
Theory and Applications of Graphs, 2017 A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest.
Yair Caro, Josef Lauri, Christina Zarb
doaj +1 more source
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
PERFECT MATCHING PADA GRAF DENGAN DEKOMPOSISI LDU [PDF]
, 2010 Matching pada graf tidak berarah G=(V,E) adalah himpunan garis M⊆E dari G dimana tidak terdapat dua buah garis di M yang memiliki titik akhir yang sama.
Saiful Adhi Saputra, Saiful Adhi
core +1 more source
Exploration of CPCD number for power graph
مجلة بغداد للعلوم, 2023 Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and ...
S. Anuthiya, G. Mahadevan, C. Sivagnanam
doaj +1 more source
Bichromatic Perfect Matchings with Crossings
, 2023 Appears in the Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023)
Oswin Aichholzer +4 more
openaire +2 more sources
On the number of perfect matchings in random polygonal chains
Open Mathematics, 2023 Let GG be a graph. A perfect matching of GG is a regular spanning subgraph of degree one. Enumeration of perfect matchings of a (molecule) graph is interest in chemistry, physics, and mathematics.
Wei Shouliu +3 more
doaj +1 more source
Conditional Strong Matching Preclusion of the Alternating Group Graph
Theory and Applications of Graphs, 2019 The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
doaj +1 more source