Results 211 to 220 of about 2,050,476 (233)

Two-phase model of ageing in mice for improved identification of age-related and late life metabolic decline. [PDF]

open access: yesBMC Biol
Cansell C   +12 more
europepmc   +1 more source

Signed graphs with maximum nullity two

open access: yesLinear Algebra and its Applications, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marina Arav   +2 more
openaire   +5 more sources

Maximum nullity and zero forcing number on graphs with maximum degree at most three

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meysam Alishahi
exaly   +4 more sources

Minimum-rank and maximum-nullity of graphs and their linear preservers

Linear and Multilinear Algebra, 2020
The 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
exaly   +2 more sources

Signed graphs with stable maximum nullity at most two

Linear Algebra and its Applications, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marina Arav   +2 more
openaire   +1 more source

On the nullity of a connected graph in terms of order and maximum degree

Linear Algebra and its Applications, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bo Cheng, Muhuo Liu, Bit-Shun Tam
openaire   +2 more sources

Signed Graphs with Maximum Nullity at Most Two

2022
A 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

Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph [PDF]

open access: yesJournal of Graph Theory, 2013
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

Home - About - Disclaimer - Privacy