Results 41 to 50 of about 65 (64)
Signed graphs with strong (anti-)reciprocal eigenvalue property
A (signed) graph is said to exhibit the strong reciprocal (anti-reciprocal) eigenvalue property (SR) (resp., (-SR)) if for any eigenvalue λ\lambda , it has 1λ\frac{1}{\lambda } (resp.,−1λ-\frac{1}{\lambda }) as an eigenvalue as well, with the same ...
Belardo Francesco, Huntington Callum
doaj +1 more source
Computing the determinant of a signed graph
A signed graph is a simple graph in which every edge has a positive or negative sign. In this article, we employ several algebraic techniques to compute the determinant of a signed graph in terms of the spectrum of a vertex-deleted subgraph.
Alshamary Bader, Stanić Zoran
doaj +1 more source
Some bounds on the distance-sum-connectivity matrix. [PDF]
Gök GK.
europepmc +1 more source
Elite Bernoulli-based mutated dung beetle algorithm for global complex problems and parameter estimation of solar photovoltaic models. [PDF]
Elhosseny M +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Weighted graphs with an application to returned sequence
Advanced Studies: Euro-Tbilisi Mathematical Journal, 2023Ali A Shukur
exaly
Constructing cospectral signed graphs
Linear and Multilinear Algebra, 2021Francesco Belardo +2 more
exaly
On the adjacency matrix of a complex unit gain graph
Linear and Multilinear Algebra, 2022Ranjit Mehatari +2 more
exaly
On cospectral oriented graphs and cospectral signed graphs
Linear and Multilinear Algebra, 2022Zoran Stanić
exaly
On the inverse of unicyclic 3-coloured digraphs
Linear and Multilinear Algebra, 2022Debajit Kalita
exaly

