Zobrazeno 1 - 10
of 345
pro vyhledávání: '"Ilić, Aleksandar"'
Integral circulant graphs are proposed as models for quantum spin networks that permit a quantum phenomenon called perfect state transfer. Specifically, it is important to know how far information can potentially be transferred between nodes of the q
Externí odkaz:
http://arxiv.org/abs/2307.09081
Autor:
Marques, Diogo, Campos, Rafael, Santander-Jiménez, Sergio, Matveev, Zakhar, Sousa, Leonel, Ilic, Aleksandar
Developments in Genome-Wide Association Studies have led to the increasing notion that future healthcare techniques will be personalized to the patient, by relying on genetic tests to determine the risk of developing a disease. To this end, the detec
Externí odkaz:
http://arxiv.org/abs/2201.10956
The Steiner $k$-eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$-subsets of $V (G)$ which contain $v$. A linear time algorithm for calculating the Steiner $k$-eccentricity of a vertex on block graphs is present
Externí odkaz:
http://arxiv.org/abs/2112.01140
Autor:
Ilic, Aleksandar
The Steiner $k$-eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$-subsets of $V (G)$ which contain $v$. In this note, we design a linear algorithm for computing the Steiner $3$-eccentricities and the connective
Externí odkaz:
http://arxiv.org/abs/2008.09299
Autor:
Ilic, Aleksandar, Dehmer, Matthias
In this note we resolve three conjectures from [M. Dehmer, S. Pickl, Y. Shi, G. Yu, \emph{New inequalities for network distance measures by using graph spectra}, Discrete Appl. Math. 252 (2019), 17--27] on the comparison of distance measures based on
Externí odkaz:
http://arxiv.org/abs/1912.08412
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Information and Computation December 2024 301 Part B
The transmission of a vertex $v$ of a graph $G$ is the sum of distances from $v$ to all the other vertices in $G$. The Wiener complexity of $G$ is the number of different transmissions of its vertices. Similarly, the eccentric complexity of $G$ is de
Externí odkaz:
http://arxiv.org/abs/1905.05968
Modern heterogeneous computing architectures, which couple multi-core CPUs with discrete many-core GPUs (or other specialized hardware accelerators), enable unprecedented peak performance and energy efficiency levels. Unfortunately, though, developin
Externí odkaz:
http://arxiv.org/abs/1905.00661
Autor:
Ilic, Aleksandar, Basic, Milan
Given a graph $G$, we associate a path matrix $P$ whose $(i, j)$ entry represents the maximum number of vertex disjoint paths between the vertices $i$ and $j$, with zeros on the main diagonal. In this note, we resolve four conjectures from [M. M. Shi
Externí odkaz:
http://arxiv.org/abs/1810.04870