Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Zoran Stanic"'
Autor:
Zoran Stanic
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 257-263 (2021)
The second smallest eigenvalue of the Laplacian matrix of a graph G is called the algebraic connectivity and denoted by a(G). We prove thata(G)>π2/3(p(12g(n1, n2, …, np)2 − π2)/4g(n1, n2, …, np)4 + 4(q − p)(3g(np + 1, np + 2, …, nq)2 −
Externí odkaz:
https://doaj.org/article/a33124eee9514882a28c3ea098098a1e
Autor:
Farzaneh Ramezani, Zoran Stanic
Publikováno v:
Discrete Mathematics Letters, Vol 5, Pp 24-28 (2021)
Externí odkaz:
https://doaj.org/article/125e551646f443bfa0128720f16149c4
Autor:
Zoran Stanic
Publikováno v:
Discrete Mathematics Letters, Vol 3, Pp 9-13 (2020)
Externí odkaz:
https://doaj.org/article/c935e849e25b4cc49e411e69065b080e
Autor:
Zoran Stanić
Written for mathematicians working with the theory of graph spectra, this (primarily theoretical) book presents relevant results considering the spectral properties of regular graphs. The book begins with a short introduction including necessary term
Publikováno v:
The Electronic Journal of Linear Algebra. :559-571
In this paper, we provide a new family of tridiagonal matrices whose eigenvalues are perfect squares. This result motivates the computation of the spectrum of a particular antibidiagonal matrix. As an application, we consider the Laplacian controllab
Autor:
Zoran Stanić
Publikováno v:
Discrete Mathematics Letters, Vol 14, Pp 70-76 (2024)
Externí odkaz:
https://doaj.org/article/5b8985bbd9d743b4a1f2470074de77ad
Publikováno v:
AIMS Mathematics, Vol 9, Iss 9, Pp 25689-25704 (2024)
We consider the controllability of multi-agent dynamical systems modeled by a particular class of bipartite graphs, called chain graphs. Our main focus is related to chain graphs with exactly one repeated degree. We determine all chain graphs with th
Externí odkaz:
https://doaj.org/article/36544eef66c44393baf3fb0b80093217
Autor:
Zoran Stanić
Written for mathematicians working with the theory of graph spectra, this book explores more than 400 inequalities for eigenvalues of the six matrices associated with finite simple graphs: the adjacency matrix, Laplacian matrix, signless Laplacian ma
Autor:
M Zoran Stanic
Publikováno v:
Publikacije Elektrotehni?kog fakulteta - serija: matematika. :88-93
We present a mathematical game for two players based on spectral graph theory. We solve some cases and discuss a general strategy for unsolved ones. In addition, we present some data on graphs with integer index.
Publikováno v:
AIMS Mathematics, Vol 6, Iss 5, Pp 5078-5087 (2021)
We revisit results obtained in [1], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian were obtained. We present these results in new forms, now stated in terms of structural parameters t
Externí odkaz:
https://doaj.org/article/50ea7b1bd2ed40a1a12ec125ac8e1711