Results 211 to 220 of about 2,177,028 (229)
Maximum Nullity of Some Cayley Graphs [PDF]
Recently, the nullity, the algebraic multiplicity of the number zero in the spectrum of the adjacency matrix, of a molecular graph has received a lot of attention as it has a number of direct appli...
E. Vatandoost, Y. Golkhandy Pour
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Signed graphs with stable maximum nullity at most two
Linear Algebra and its Applications, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marina Arav +2 more
openaire +1 more source
Maximum Nullity and Zero Forcing Number of Graphs With Rank at Most 4
Let G be a simple graph with n vertices. The rank of G is the number of non-zero eigenvalues of its adjacency matrix and denoted by rank(G).
Katayoun Nozari, Ebrahim Vatandoost
exaly +2 more sources
On the nullity of a connected graph in terms of order and maximum degree
Linear Algebra and its Applications, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bo Cheng, Muhuo Liu, Bit-Shun Tam
openaire +2 more sources
On the Nullity of Graphs [PDF]
The nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. It is known that η(G) ≤ n − 2 if G is a simple graph on n vertices and G is notisomorphic to nK1.
Bolian Liu
exaly +2 more sources
Minimum-rank and maximum-nullity of graphs and their linear preservers
Linear and Multilinear Algebra, 2020The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose i j t h entry (for i ≠ j ) is nonzero whenever ( i , j ) is an edge in G and ...
LeRoy B. Beasley, Seok-Zun Song
openaire +1 more source
Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph [PDF]
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms and have application to computer science.
Bryan Shader +2 more
exaly +1 more source
Signed Graphs with Maximum Nullity at Most Two
2022A signed graph is an ordered pair (G,ä), where G = (V, E) is a graph and ä ? E. The edges in ä are called odd, and the edges in E \ ä are called even. The family of matrices S(G,ä) is defined such that if [ai,j] = A ? S(G,ä), then ai,j < 0 if there is at least one edge between i and j and if all edges between i and j are even; ai,j > 0 if there is at ...
openaire +1 more source
Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
Linear Algebra and its Applications, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bo Cheng, Muhuo Liu, Bolian Liu
openaire +1 more source
An upper bound of the nullity of a graph in terms of order and maximum degree
Linear Algebra and its Applications, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhou, Qi, Wong, Dein, Sun, Dongqin
openaire +1 more source

