نتایج جستجو برای: k nullity

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

Journal: :حقوق خصوصی 0
محسن ایزانلو استادیار گروه حقوق خصوصی دانشکده حقوق دانشگاه تهران صادق شریعتی نسب دانشجوی دکتری حقوق خصوصی دانشگاه تهران

unenforceability (inopposabilité) is a double sanction. because this sanction combines in the same time “validity” and “nullity”, validity between the parties and nullity to third parties. our law obtains this sanction from french law. thus for an exact study, referring to original law is inevitable. in iranian law there are sporadic instances of unenforceability. but sometimes unenforceability...

2017
Francesco Barioli Shaun M. Fallat H. Tracy Hall Daniel Hershkowitz Leslie Hogben Hein van der Holst Bryan Shader FRANCESCO BARIOLI SHAUN M. FALLAT LESLIE HOGBEN HEIN VAN DER HOLST BRYAN SHADER

The minimum rank of a directed graph Γ is defined to be the smallest possible rank over all real matrices whose ijth entry is nonzero whenever (i, j) is an arc in Γ and is zero otherwise. The symmetric minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero o...

2017
Matthias Nagel Mark Powell

We determine for which complex numbers on the unit circle the Levine-Tristram signature and the nullity give rise to link concordance invariants. 2010 Mathematics Subject Classification: primary: 57M25, secondary: 57M27, 57N70

Journal: :Indian journal of medical ethics 2015
Soumitra Pathare Renuka Nardodkar Laura Shields Joske F G Bunders Jaya Sagade

INTRODUCTION Section 5(ii) of The Hindu Marriage Act, 1955 (HMA) states that under certain circumstances, mental illness is accepted as a ground for the annulment of marriage, while Section 13(1) (iii) states that mental illness is a ground for divorce. There is little data on how this provision is used and applied in matrimonial petitions. This paper assesses judicial practices in divorce case...

2013
Ying Liu Weigen Yan Y. Liu

Let G be a graph with n vertices and ν(G) be the matching number of G. The inertia of a graph G, In(G) = (n+, n−, n0) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let η(G) = n0 denote the nullity of G (the multiplicity of the eigenvalue zero of G). It is well known that if G is a tree, then η(G) = n− 2ν(G). Gu...

Journal: :Michigan Mathematical Journal 1968

Journal: :Advances in Applied Clifford Algebras 2015

Journal: :Differential Geometry and its Applications 2012

Journal: :The Modern Law Review 1956

2011
R. B. Bapat

It is shown that if G is a graph with an odd number of spanning trees, then the line graph L(G) of G has nullity at most one.

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

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