Results 31 to 40 of about 2,050,476 (233)

The Bipartite Zero Forcing Set for a Full Sign Pattern Matrix

Mathematics, 2020
For an m × n sign pattern P, we define a signed bipartite graph B ( U , V ) with one set of vertices U = { 1 , 2 , … , m } based on rows of P and the other set of vertices V = { 1 ′ , 2 ′ , … ,
Gu-Fang Mou, Tian-Fei Wang, Zhong-Shan Li   +2 more
doaj   +1 more source

The Number of P-Vertices of Singular Acyclic Matrices: An Inverse Problem

Discussiones Mathematicae Graph Theory, 2020
Let A be a real symmetric matrix. If after we delete a row and a column of the same index, the nullity increases by one, we call that index a P-vertex of A.
Du Zhibin, da Fonseca Carlos M.
doaj   +1 more source

Bounds for the Zero Forcing Number of Graphs with Large Girth

Theory 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

Arquivo 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, J.F.C. Silva, E. Detmann, H.M. Vasquez, P.A.M. Malafaia   +4 more
doaj   +1 more source

On the nullity of bicyclic graphs [PDF]

, 2008
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we obtain the nullity set of bicyclic graphs of order n, and determine the bicyclic graphs with maximum ...
Liu, Bolian, Hu, Shengbiao, Xuezhong, Tan   +2 more
core   +1 more source

Maximum nullity of Cayley graph

, 2017
One of the most interesting problems on maximum nullity (minimum rank) is to characterize $M(\mathcal{G})$ ($mr(\mathcal{G})$) for a graph $\mathcal{G}$. In this regard, many researchers have been trying to find an upper or lower bound for the maximum nullity. For more results on this topic, see \cite{4}, \cite{2}, \cite{10} and \cite{1}. In this paper,
Vatandoost, Ebrahim, Pour, Yasser Golkhandy   +1 more
openaire   +2 more sources

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

Journal of Graph Theory, 2012
AbstractTree‐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. The zero forcing number is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by a graph.
Francesco Barioli, Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Bryan L. Shader, Pauline van den Driessche, Hein van der Holst   +7 more
openaire   +6 more sources

A characterization of graphs G with nullity |V(G)|–2m(G)＋2c(G)

, 2015
By |V(G)|, |E(G)|, η(G), and m(G) we denote respectively the order, the number of edges, the nullity, and the matching number of a (simple) graph G. Recently Wang and Wong have proved that for every graph G , η(G)≤|V(G)|−2m(G)+2c(G), where c(G)=|E(G ...
Song, Ya-zhi; Song, Xiao-qiu; Tam Bit-Shun
core   +1 more source

On the nullity of tricyclic graphs [PDF]

, 2011
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 not isomorphic to nK1.
Bolian Liu, Liu, Bolian, Cheng, Bo, Bo Cheng   +3 more
core   +1 more source

An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes

FEBS Letters, EarlyView.
GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg, Martine Hjeltnes, Josephine Krieger, Joshua E. Elias, Maria Stensland, Kristian Holm, Xiaojun Jiang, Chuki Khangsar, Tuula A. Nyman, Arthur Kaser, Johannes R. Hov, Tom H. Karlsen, Nicole C. Kaneider, Frode L. Jahnsen, Georg Schneditz   +14 more
wiley   +1 more source