Results 41 to 50 of about 13,009 (241)

Bounds for the Zero Forcing Number of Graphs with Large Girth

open access: yesTheory and Applications of Graphs, 2015
The zero-forcing number, Z(G) is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the graph. A simple lower bound is δ ≤ Z(G) where δ is the minimum degree.
Randy Davila, Franklin Kenter
doaj   +1 more source

Estimação do valor energético da pastagem e simulação de parâmetros do desempenho produtivo de novilhas em pasto Estimation of pasture energy value and simulation of productive performance of heifers under grazing

open access: yesArquivo Brasileiro de Medicina Veterinária e Zootecnia, 2008
Estimaram-se o valor energético das forrageiras e o consumo de matéria seca por novilhas, em função do ganho de peso, criadas em pastagens de capim-elefante (Pennisetum purpureum Schum. cv. Napier) e capim-mombaça (Panicum maximum, cv.
F.N. Lista   +4 more
doaj   +1 more source

Magnetic interpretation of the nodal defect on graphs [PDF]

open access: yes, 2012
In this note, we present a natural proof of a recent and surprising result of Gregory Berkolaiko (arXiv 1110.5373) interpreting the "Courant nodal defect" of a Schr\"odinger operator on a finite graph as a Morse index associated to the deformations of ...
Colin de Verdière, Fiedler
core   +3 more sources

A Characterization of the Number of Roots of Linearized and Projective Polynomials in the Field of Coefficients

open access: yes, 2019
A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive nature.
McGuire, Gary, Sheekey, John
core   +1 more source

Zero forcing in iterated line digraphs

open access: yes, 2018
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line ...
Ferrero, Daniela   +2 more
core   +1 more source

On the positive and negative inertia of weighted graphs [PDF]

open access: yes, 2013
The number of the positive, negative and zero eigenvalues in the spectrum of the (edge)-weighted graph $G$ are called positive inertia index, negative inertia index and nullity of the weighted graph $G$, and denoted by $i_+(G)$, $i_-(G)$, $i_0(G ...
Li, Shuchao, Song, Feifei
core  

An upstream open reading frame regulates expression of the mitochondrial protein Slm35 and mitophagy flux

open access: yesFEBS Letters, EarlyView.
This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva   +5 more
wiley   +1 more source

Failed Zero Forcing Numbers of Trees and Circulant Graphs

open access: yesTheory and Applications of Graphs
Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule (described below) results in all vertices being in $S$.
Luis Gomez   +4 more
doaj   +1 more source

Cell‐cycle‐specific lesion evolution rather than inhibition of double‐strand‐break repair underpins cisplatin radiosensitization

open access: yesMolecular Oncology, EarlyView.
We analyze cisplatin–DNA adducts (CDAs) and double‐strand breaks (DSBs) in a cell‐cycle‐dependent manner. We find that CDAs form similarly across all cell cycle phases. DSBs arise only in S‐phase. CDAs might not directly impair DSB repair, but S‐phase DSB lesions evolve in the presence of CDAs and disrupt repair in G2, also causing radiosensitization ...
Ye Qiu   +10 more
wiley   +1 more source

Home - About - Disclaimer - Privacy