Results 1 to 10 of about 376 (79)
Maximum nullity and zero forcing of circulant graphs
The zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and some inverse eigenvalue problems.
Duong Linh +4 more
doaj +2 more sources
Families of graphs with maximum nullity equal to zero forcing number
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symmetric real matrices whose ijth entry is nonzero exactly when fi, jg is an edge in G for i =6 j, and the iith entry is any real number.
Alameda Joseph S. +7 more
doaj +2 more sources
Change of nullity of a graph under two operations
Two adjacent or non-adjacent vertices of a graph G are said to be identified, if they are combined to form one vertex whose neighbor is the union of their neighborhoods (ignoring any loops or multiple edges formed).
Gohdar H. Mohiaddin, Khidir R. Sharaf
doaj +1 more source
AUTOMATED UAV LIDAR STRIP ALIGNMENT IN FORESTED AREAS USING DENSITY-BASED CANOPY CLUSTERING [PDF]
Recently, LiDAR point cloud data acquired by Unmanned Aerial Vehicles (UAVs) are used in many scientific disciplines and like the former photogrammetric techniques these data are usually collected in overlapping strips. Generation of comprehensive models
R. Fekry, W. Yao, L. Cao
doaj +1 more source
The Bipartite Zero Forcing Set for a Full Sign Pattern Matrix
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 +2 more
doaj +1 more source
On the nullity number of graphs
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007) 60--67] that $\eta \le n - D$, where $\eta$, n and D denote the nullity number, the order ...
Mustapha Aouchiche, Pierre Hansen
doaj +1 more source
The Number of P-Vertices of Singular Acyclic Matrices: An Inverse Problem
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
ZERO FORCING NUMBER AND MAXIMUM NULLITY OF GENERAL POWER GRAPHS [PDF]
Let Γ = (V,E) be a simple and undirected graph. General power graph of Γ, shown by Pg(Γ), is a graph with the vertex set P(V (Γ))\ϕ. Also two distinct vertices of B and C are adjacent if and only if every b ∈ B is adjacent to every c ∈ C \{b} in Γ.
Fateme Kheiridosst, Ebrahim Vatandoost
doaj +1 more source
Bounds for the Zero Forcing Number of Graphs with Large Girth
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
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

