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

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

Journal: :kuwait journal of science 2021

The nullity of a graph G is the multiplicity zero as an eigenvalue its adjacency matrix. An assignment weights to vertices graph, that satisfies sum condition over neighbors each vertex, and uses maximum number independent variables denoted by high weighting graph. This applicable tool used determine Two types graphs are defined, change their nullities studied, namely, G+ab constructed from add...

Journal: :Studia Iuridica Lublinensia 2021

<p>For many years there has been a dispute in the field of commercial law concerning nature ruling issued as part an action for annulment resolution general meeting under Article 425 Code Commercial Companies (hereinafter: CCC). The multitude both studies representatives doctrine and opinions expressed court decisions, allows this to be included two opposing theses, which, together with a...

2013
WAYNE BARRETT JOHN SINKOVIC

Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For each graph G, there is an associated minimum rank class, M R (G) consisting of all matrices A ∈ S (G) with rankA = mr (G), the minimum rank among all matrices in S (G)....

2011
Allie Mazzia James Juett

We implemented support for non-null types in Java according to the description in [1]. We built our implementation on top of the Polyglot Java compiler as a language extension. Our extension allows programmers to provide annotations specifying whether a variable is allowed to ever take on a null value and provides an augmented type system to enforce these guarantees. Once the separation between...

2017
Wayne Barrett Nicole Malloy Curtis Nelson William Sexton John Sinkovic WAYNE BARRETT JOHN SINKOVIC

Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For each graph G, there is an associated minimum rank class, M R (G) consisting of all matrices A ∈ S (G) with rankA = mr (G), the minimum rank among all matrices in S (G)....

Journal: :Transactions of the American Mathematical Society 1969

Journal: :Agora International Journal of Juridical Sciences 2013

Journal: :Abstract and Applied Analysis 2021

Let A and id="M2"> mathvariant="script">B be two closed linear relations acting between Banach spaces id="M3"> X id="M4"> Y , let id="M5"> λ a complex number. We study the stability of nullity deficiency id="M6"> when it is perturbed by id="M7"> . In particular, we sho...

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

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