Results 1 to 10 of about 494 (225)
Maximum nullity and zero forcing of circulant graphs [PDF]
Special Matrices, 2020 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 +4 more sources
Families of graphs with maximum nullity equal to zero forcing number
Special Matrices, 2018 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 +4 more sources
Change of nullity of a graph under two operations
Kuwait Journal of Science, 2021 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]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 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
Maximum nullity of some Cayley graphs [PDF]
Cogent Mathematics & Statistics, 2018 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
openaire +1 more source
Two-connected signed graphs with maximum nullity at most two [PDF]
Linear Algebra and its Applications, 2021 A signed graph is a pair $(G, )$, where $G=(V,E)$ is a graph (in which parallel edges are permitted, but loops are not) with $V=\{1,\ldots,n\}$ and $ \subseteq E$. The edges in $ $ are called odd and the other edges of $E$ even. By $S(G, )$ we denote the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ with $a_{i,j}<0$ if $i$ and $j$ are ...
Marina Arav +3 more
openaire +2 more sources
Line graphs: Their maximum nullities and zero forcing numbers [PDF]
Czechoslovak Mathematical Journal, 2016 The main aim of this paper is to analyze the maximum nullity and zero forcing number, and their positive counterparts, for general families of line graphs associated with graphs possessing some specific properties. In [\textit{F. Barioli} et al., Linear Algebra Appl. 428, No.
Fallat, Shaun, Soltani, Abolghasem
openaire +2 more sources
The number of P-vertices in a matrix with maximum nullity [PDF]
Linear Algebra and its Applications, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fernandes, Rosário +1 more
openaire +5 more sources
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 +2 more
doaj +1 more source
Zero forcing and maximum nullity for hypergraphs [PDF]
Discrete Applied Mathematics, 2020 The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way zero forcing was defined as an upper bound for the maximum nullity of the family of symmetric matrices whose nonzero pattern of entries is described by a given graph: A family of symmetric hypermatrices is associated with a uniform hypergraph and zeros ...
openaire +3 more sources