Zobrazeno 1 - 10
of 2 070
pro vyhledávání: '"A. Damnjanović"'
We present a universal and straightforward algebraic procedure for flat bands construction, polynomial indicator method. Using only Bloch Hamiltonian eigendeterminant functional to identify conditions that guarantee existence of nondispersive eigenva
Externí odkaz:
http://arxiv.org/abs/2410.09587
The spectral radius of a graph is the spectral radius of its adjacency matrix. A threshold graph is a simple graph whose vertices can be ordered as $v_1, v_2, \ldots, v_n$, so that for each $2 \le i \le n$, vertex $v_i$ is either adjacent or nonadjac
Externí odkaz:
http://arxiv.org/abs/2412.16019
Autor:
Bašić, Nino, Damnjanović, Ivan
A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\ell$-circulant graph is a graph that admits a cyclic group of automorphisms having $\ell$ v
Externí odkaz:
http://arxiv.org/abs/2411.16904
A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely many $d$-regular nut graphs exist for $3 \leq d \leq 12$ and for $d \
Externí odkaz:
http://arxiv.org/abs/2410.14063
An expression is any mathematical formula that contains certain formal variables and operations to be executed in a specified order. In computer science, it is usually convenient to represent each expression in the form of an expression tree. Here, w
Externí odkaz:
http://arxiv.org/abs/2405.13928
Publikováno v:
Electron. J. Combin. 31 (2024) #P2.31
A nut graph is a simple graph whose adjacency matrix has the eigenvalue zero with multiplicity one such that its corresponding eigenvector has no zero entries. It is known that there exist no cubic circulant nut graphs. A bicirculant (resp. tricircul
Externí odkaz:
http://arxiv.org/abs/2312.14884
Autor:
Alizadeh, Yaser, Bašić, Nino, Damnjanović, Ivan, Došlić, Tomislav, Pisanski, Tomaž, Stevanović, Dragan, Xu, Kexiang
A nonnegative integer $p$ is realizable by a graph-theoretical invariant $I$ if there exist a graph $G$ such that $I(G) = p$. The inverse problem for $I$ consists of finding all nonnegative integers $p$ realizable by $I$. In this paper, we consider a
Externí odkaz:
http://arxiv.org/abs/2312.13083
Autor:
Damnjanović, Ivan
The transmission of a vertex in a connected graph is the sum of its distances to all the other vertices. A graph is transmission irregular (TI) when all of its vertices have mutually distinct transmissions. In an earlier paper, Al-Yakoob and Stevanov
Externí odkaz:
http://arxiv.org/abs/2311.14259
Publikováno v:
Acta Educationis Generalis, Vol 14, Iss 3, Pp 83-92 (2024)
Introduction: This research aims to analyze students’ expectations and satisfaction with the quality of online learning in Serbia during the COVID-19 pandemic, while examining its advantages, disadvantages, and future intentions.
Externí odkaz:
https://doaj.org/article/10def5c34cb94428be69cbf1725d949c
Autor:
Damnjanovic, Milan, Milosevic, Ivanka
Vanishing of the total angular momentum of the electrons occupying all orbitals of a closed shell in an atom is a textbook fact. Understanding the symmetry content of the atomic shell as irreducible representation of angular momentum, enables straigh
Externí odkaz:
http://arxiv.org/abs/2307.13652