Zobrazeno 1 - 10
of 163
pro vyhledávání: '"Vetrík Tomáš"'
Autor:
Vetrík Tomáš
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 67-76 (2020)
The undirected circulant graph Cn(±1, ±2, . . . , ±t) consists of vertices v0, v1, . . . , vn−1 and undirected edges vivi+j, where 0 ≤ i ≤ n − 1, 1 ≤ j ≤ t (2 ≤ t ≤ n2{n \over 2} ), and the directed circulant graph Cn(1, t) consist
Externí odkaz:
https://doaj.org/article/4e779e8654a94cbc915a47e88aa1bb77
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 3, Pp 823-834 (2017)
For positive integers Δ and D we define nΔ,D to be the largest number of vertices in an outerplanar graph of given maximum degree Δ and diameter D. We prove that nΔ,D=ΔD2+O (ΔD2−1)$n_{\Delta ,D} = \Delta ^{{D \over 2}} + O\left( {\Delta ^{{D
Externí odkaz:
https://doaj.org/article/58f66e343f9c410e89e7f50fdbbeb213
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 4, Pp 867-876 (2016)
The Gutman index and the edge-Wiener index have been extensively investigated particularly in the last decade. An important stream of re- search on graph indices is to bound indices in terms of the order and other parameters of given graph. In this p
Externí odkaz:
https://doaj.org/article/fa2cdc89aa58433d87ed8782858f539a
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 Journal of King Saud University - Science October 2023 35(7)
Autor:
Vetrík, Tomáš
Publikováno v:
In Discrete Applied Mathematics 15 July 2023 333:59-70
Autor:
Vetrík, Tomáš1 vetrikt@ufs.ac.za, Abas, Marcel2 abas@stuba.sk
Publikováno v:
Communications in Combinatorics & Optimization. 2024, Vol. 9 Issue 1, p89-99. 11p.
Autor:
VETRÍK, TOMÁŠ1 vetrikt@ufs.ac.za
Publikováno v:
Transactions on Combinatorics. 2023, Vol. 12 Issue 4, p227-238. 12p.
We introduce a variation of metric dimension, called the multiset dimension. The representation multiset of a vertex $v$ with respect to $W$ (which is a subset of the vertex set of a graph $G$), $r_m (v|W)$, is defined as a multiset of distances betw
Externí odkaz:
http://arxiv.org/abs/1711.00225
Autor:
Alfuraidan, Monther Rashed a, Das, Kinkar Chandra b, Vetrík, Tomáš c, ⁎, Balachandran, Selvaraj d
Publikováno v:
In Discrete Applied Mathematics 15 January 2022 306:7-16