نتایج جستجو برای: common minimal $cn$

تعداد نتایج: 834097  

Journal: :transactions on combinatorics 2013
p.siva kota reddy k.r. rajanna kavita s permi

in this paper, we define the common minimal common neighborhooddominating signed graph (or common minimal $cn$-dominating signedgraph) of a given signed graph and offer a structuralcharacterization of common minimal $cn$-dominating signed graphs.in the sequel, we also obtained switching equivalencecharacterization: $overline{sigma} sim cmcn(sigma)$, where$overline{sigma}$ and $cmcn(sigma)$ are ...

Journal: :transactions on combinatorics 2012
anwar saleh alwardi n. d. soner

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.

Journal: :Journal of Physics: Conference Series 2021

Journal: :ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE 2009

1999
DMITRI ZAITSEV

We prove that a germ of a holomorphic map f between Cn and Cn ′ sending one real-algebraic submanifold M ⊂ Cn into another M ′ ⊂ Cn ′ is algebraic provided M ′ contains no complex-analytic discs and M is generic and minimal. We also propose an algorithm for finding complex-analytic discs in a real submanifold.

2000
W. D. Gao

Let Cn be the cyclic group of n elements, and let S = (a1, · · · , ak) be a sequence of elements in Cn. We say that S is a zero sequence if ∑k i=1 ai = 0 and that S is a minimal zero-sequence if S is a zero sequence and S contains no proper zero subsequence. In this paper we prove, among other results, that if S is a minimal zero sequence of elements in Cn and |S| ≥ n − [ 3 ] + 1, then there ex...

Journal: :transactions on combinatorics 2012
p. siva reddy b. prashanth

‎in this paper‎, ‎we define the common minimal dominating signed‎ ‎graph of a given signed graph and offer a structural‎ ‎characterization of common minimal dominating signed graphs‎. ‎in‎ ‎the sequel‎, ‎we also obtained switching equivalence‎ ‎characterizations‎: ‎$overline{s} sim cmd(s)$ and $cmd(s) sim‎ ‎n(s)$‎, ‎where $overline{s}$‎, ‎$cmd(s)$ and $n(s)$ are complementary‎ ‎signed gra...

Journal: :E3S web of conferences 2021

Alzheimer’s disease (AD) is a heterogeneous disease. Exploring the characteristics of each AD subtype key to disentangling heterogeneity. Minimal atrophy (MAD) common that yields conflicting results. In order evaluate this aspect across relatively large populations, total 192 and 228 cognitively normal (CN) subjects were processed by automated segmentation scheme FreeSurfer, which generates reg...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید