Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Stevanović, Dragan"'
We note here that the problem of determining extremal values of Sombor index for trees with a given degree sequence fits within the framework of results by Hua Wang from [Cent. Eur. J. Math. 12 (2014) 1656-1663], implying that the greedy tree has the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7dfdaa796d94bfa26be0f650981f39c8
http://arxiv.org/abs/2211.11920
http://arxiv.org/abs/2211.11920
Autor:
Damnjanović, Ivan, Stevanović, Dragan
Recently, Gutman [MATCH Commun. Math. Comput. Chem. 86 (2021) 11-16] defined a new graph invariant which is named the Sombor index $\mathrm{SO}(G)$ of a graph $G$ and is computed via the expression \[ \mathrm{SO}(G) = \sum_{u \sim v} \sqrt{\mathrm{de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5e43a5646964c05e30fa6d48507d3d0
For a graph $G$, its energy $\mathcal{E}(G)$ is the sum of absolute values of the eigenvalues of its adjacency matrix, the matching number $\mu(G)$ is the number of edges in a maximum matching of $G$, while $\Delta$ is the maximum vertex degree of $G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=arXiv_______::b44abaaa3c0e9c214a232e0040ab38ad
http://arxiv.org/abs/2111.15303
http://arxiv.org/abs/2111.15303
In a recent series of papers, Hosoya drew the attention to a particular aspect of constructing cospectral graphs by using coalescences: that cospectral graphs can be constructed by attaching multiple copies of a rooted graph in different ways to subs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2bbf83395862a922f3d9e1f02cc8c70
Autor:
Stevanović, Dragan A.
Publikováno v:
Универзитет у Нишу
The main goal of this dissertation is to estimate the remaining useful life of minimum oil circuit breakers (CB) based on data collected during their regular inspection. Using the proposed approach, CB’s with the highest risk can be identified, who
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=nardusnacion::b3d1a97bcf004f6a6921d94f3efcb9e3
https://hdl.handle.net/21.15107/rcub_nardus_21168
https://hdl.handle.net/21.15107/rcub_nardus_21168
Publikováno v:
Scientific Technical Review, Vol 66, Iss 4, Pp 22-28 (2016)
In this paper the selection of appropriate UAV catapult launch system from the supply on the world market for existing tactical - medium range Unmanned Aerial Vehicle (UAV) in the Serbian Army is analyzed. A special emphasis was placed on UAV structu
It was conjectured in literature that the inequality M1(G)/n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=57a035e5b1ae::e5fe21a6c10d4ed974cbef2cf4f6934d
https://www.bib.irb.hr/879938
https://www.bib.irb.hr/879938
The index of a graph is the largest eigenvalue of its adjacency matrix. A starlike is a tree having a unique vertex of degree $r>2$. We show how to order the starlike trees with $n>3$ by their indices. In particular, the indices of starlike trees are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bbc7866f6d0ce214b4993cc3a6e846a
Autor:
Stevanović, Dragan
Publikováno v:
Ars mathematica contemporanea
While discussing his spectral bound on the independence number of a graph, Herbert Wilf asked back in 1986 what kind of a graph admits an eigenvector consisting solely of ?$\pm 1$? entries? We prove that Wilf's problem is NP-complete, but also that t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3825::e7b130082ee0a5b8b45d968a85c1dcfc
http://www.dlib.si/details/URN:NBN:SI:doc-Z17NLJH9
http://www.dlib.si/details/URN:NBN:SI:doc-Z17NLJH9
Autor:
Ilić, Aleksandar, Stevanović, Dragan
Publikováno v:
Applied Mathematics Letters. 22(11):1715-1720