Zobrazeno 1 - 10
of 189
pro vyhledávání: '"BRUNETTI, MAURIZIO"'
A graph $G$ is divisible by a graph $H$ if the characteristic polynomial of $G$ is divisible by that of $H$. In this paper, a necessary and sufficient condition for recursive graphs to be divisible by a path is used to show that the H-shape graph $P_
Externí odkaz:
http://arxiv.org/abs/2305.02146
Autor:
Brunetti Maurizio
Publikováno v:
Special Matrices, Vol 12, Iss 1, Pp 3235-3244 (2024)
A complex unit gain graph (or T{\mathbb{T}}-gain graph) Γ=(G,γ)\Gamma =\left(G,\gamma ) is a gain graph with gains in T{\mathbb{T}}, the multiplicative group of complex units. The T{\mathbb{T}}-outgain in Γ\Gamma of a vertex v∈Gv\in G is the sum
Externí odkaz:
https://doaj.org/article/b20d1519213f48d9921f7d399e760cf0
The eccentricity matrix $\mathcal E(G)$ of a connected graph $G$ is obtained from the distance matrix of $G$ by leaving unchanged the largest nonzero entries in each row and each column, and replacing the remaining ones with zeros. In this paper, we
Externí odkaz:
http://arxiv.org/abs/2209.05248
Publikováno v:
In Linear Algebra and Its Applications 1 October 2024 698:56-72
Publikováno v:
In Discrete Mathematics April 2024 347(4)
Autor:
Belardo, Francesco, Brunetti, Maurizio
Publikováno v:
In Discrete Mathematics February 2024 347(2)
In 1972, A. J. Hoffman proved his celebrated theorem concerning the limit points of spectral radii of non-negative symmetric integral matrices less than $\sqrt{2+\sqrt{5}}$. In this paper, after giving a new version of Hoffman's theorem, we get two g
Externí odkaz:
http://arxiv.org/abs/2012.14090
The Hoffman program with respect to any real or complex square matrix $M$ associated to a graph $G$ stems from A. J. Hoffman's pioneering work on the limit points for the spectral radius of adjacency matrices of graphs less than $\sqrt{2+\sqrt{5}}$.
Externí odkaz:
http://arxiv.org/abs/2012.13079
Publikováno v:
Linear and Multilinear Algebra 69 (2021) No. 14, 2717-2732
A well--known fact in Spectral Graph Theory is the existence of pairs of isospectral nonisomorphic graphs (known as PINGS). The work of A.J. Schwenk (in 1973) and of C. Godsil and B. McKay (in 1982) shed some light on the explanation of the presence
Externí odkaz:
http://arxiv.org/abs/1908.02220
Publikováno v:
In Advances in Applied Mathematics August 2022 139