Results 241 to 250 of about 44,879 (298)
Some of the next articles are maybe not open access.
An improved lower bound for the nullity of a graph in terms of matching number
Linear and multilinear algebra, 2020Let G be a connected undirected graph without loops and multiple edges. By , and we, respectively, denote the order, the nullity, and the matching number of G. Let , and let be a nonnegative integer defined as: To make G to be a bipartite connected graph
Xiaobin Ma, Xianwen Fang
semanticscholar +1 more source
Signed graphs with stable maximum nullity at most two
Linear Algebra and its Applications, 2021A signed graph is a pair ( G , Σ ) , where G = ( V , E ) is a graph (in which parallel edges are permitted, but loops are not) with V = { 1 , … , n } and Σ ⊆ E . The edges in Σ are called odd and the other edges of E even.
Marina Arav +2 more
semanticscholar +1 more source
Counting of lattices having nullity up to two
Journal of Combinatorial Mathematics and Combinatorial ComputingIn 2020 Bhavale and Waphare introduced the concept of a nullity of a poset as nullity of its cover graph. According to Bhavale and Waphare, if a dismantlable lattice of nullity k contains r reducible elements then 2 ≤ r ≤ 2k.
A. N. Bhavale, B. P. Aware
semanticscholar +1 more source
Proof of a conjecture on the nullity of a graph
Journal of Graph Theory, 2020Let G be a finite undirected graph without loops and multiple edges. The nullity of G , written as η(G) , is defined to be the multiplicity of 0 as an eigenvalue of its adjacency matrix.
Long Wang, Xianya Geng
semanticscholar +1 more source
Computing the dependence of graph energy on nullity: The method of siblings
Discrete Mathematics Letters, 2021The energy of a graph is the sum of absolute values of its eigenvalues. The nullity of a graph is the algebraic multiplicity of number zero in its spectrum. The dependence of graph energy on nullity is of importance in chemical applications.
I. Gutman
semanticscholar +1 more source
Journal of Combinatorial Mathematics and Combinatorial Computing
In 1940, Birkhoff raised the open problem of computing of all posets/lattices on \(n\) elements up to isomorphism for small \(n\). Many authors tried to solve this problem by providing algorithms such as nauty. In 2020, Gebhardt and Tawn given an orderly
B. P. Aware, A. N. Bhavale
semanticscholar +1 more source
In 1940, Birkhoff raised the open problem of computing of all posets/lattices on \(n\) elements up to isomorphism for small \(n\). Many authors tried to solve this problem by providing algorithms such as nauty. In 2020, Gebhardt and Tawn given an orderly
B. P. Aware, A. N. Bhavale
semanticscholar +1 more source
Nullity in Public Law: Two Recent Supreme Court Judgments
Judicial Review, 20211. In two recent judgments the Supreme Court has grappled with the concept of nullity in public law. TN (Vietnam) v Secretary of State for the Home Department concerned whether a tribunal decision, which was taken pursuant to inherently unfair and ultra ...
A. Vaughan, Michael Spencer
semanticscholar +1 more source
2013
Each Concentrate revision guide is packed with essential information, key cases, revision tips, exam Q&As, and more. Concentrates show you what to expect in a law exam, what examiners are looking for, and how to achieve extra marks. This chapter, which focuses on nullity as a way of terminating marriage or civil partnership, first explains the ...
Susan Heenan, Anna Heenan
openaire +1 more source
Each Concentrate revision guide is packed with essential information, key cases, revision tips, exam Q&As, and more. Concentrates show you what to expect in a law exam, what examiners are looking for, and how to achieve extra marks. This chapter, which focuses on nullity as a way of terminating marriage or civil partnership, first explains the ...
Susan Heenan, Anna Heenan
openaire +1 more source
Maximum nullity and zero forcing number on graphs with maximum degree at most three
Discrete Applied Mathematics, 2020A dynamic coloring of a graph G starts with an initial subset F ⊆ V ( G ) of colored vertices, while all the remaining vertices are non-colored. At each time step, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to
M. Alishahi +2 more
semanticscholar +1 more source
A Zero‐Rank, Maximum Nullity Perfect Electromagnetic Wave Absorber
Advanced Optical Materials, 2019Electromagnetic wave absorbers formed from a metamaterial layer are demonstrated and near‐perfect absorption is realized across much of the spectrum. Alternatively, an unpatterned low‐loss dielectric layer forms an absorber of coherent light and shows ...
J. Suen, K. Fan, Willie J Padilla
semanticscholar +1 more source

