Tomás Vetrík

38 papers Journal 38
YearRankTypeTitle / Venue / Authors
2025 J jnl
Degree-based function index of trees and unicyclic graphs.
J. Appl. Math. Comput.
Tomás Vetrík
2025 J jnl
General sum-connectivity index of unicyclic graphs with given maximum degree.
Discret. Appl. Math.
Elize Swartz, Tomás Vetrík
2023 J jnl
Degree-based function index for graphs with given diameter.
Discret. Appl. Math.
Tomás Vetrík
2023 J jnl
Eccentric connectivity coindex of bipartite graphs.
Discret. Math. Algorithms Appl.
Tomás Vetrík, Mesfin Masre, Selvaraj Balachandran
2023 J jnl
General Randić index of trees with given number of branching vertices.
Discret. Math. Algorithms Appl.
Tomás Vetrík
2023 J jnl
General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index.
Electron. J. Graph Theory Appl.
Tomás Vetrík
2022 J jnl
General Randić index of unicyclic graphs with given diameter.
Discret. Appl. Math.
Monther Rashed Alfuraidan, Kinkar Chandra Das, Tomás Vetrík, Selvaraj Balachandran
2022 J jnl
General sum-connectivity index of unicyclic graphs with given diameter and girth.
Discret. Math. Algorithms Appl.
Tomás Vetrík
2022 J jnl
Zeroth-order general Randić index of trees with given distance k-domination number.
Electron. J. Graph Theory Appl.
Tomás Vetrík, Mesfin Masre, Selvaraj Balachandran
2021 J jnl
General eccentric distance sum of graphs.
Discret. Math. Algorithms Appl.
Tomás Vetrík
2021 J jnl
General sum-connectivity index of unicyclic graphs with given diameter.
Discret. Appl. Math.
Monther Rashed Alfuraidan, Kinkar Chandra Das, Tomás Vetrík, Selvaraj Balachandran
2020 J jnl
Distance-based indices of complete m-ary trees.
Discret. Math. Algorithms Appl.
Mesfin Masre, Samuel Asefa Fufa, Tomás Vetrík
2020 J jnl
General Multiplicative Zagreb Indices of Graphs With Bridges.
IEEE Access
Monther Rashed Alfuraidan, Muhammad Imran, Muhammad Kamran Jamil, Tomás Vetrík
2020 J jnl
General Multiplicative Zagreb Indices of Graphs with a Small Number of Cycles.
Symmetry
Monther R. Alfuraidan, Tomás Vetrík, Selvaraj Balachandran
2020 J jnl
General eccentric connectivity index of trees and unicyclic graphs.
Discret. Appl. Math.
Tomás Vetrík, Mesfin Masre
2020 J jnl
General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number.
J. Comb. Optim.
Tomás Vetrík, Selvaraj Balachandran
2020 J jnl
Metric dimension of Cayley digraphs of split metacyclic groups.
Theor. Comput. Sci.
Marcel Abas, Tomás Vetrík
2020 J jnl
On the metric dimension of directed and undirected circulant graphs.
Discuss. Math. Graph Theory
Tomás Vetrík
2018 J jnl
A note on the Ramsey numbers for theta graphs versus the wheel of order 5.
AKCE Int. J. Graphs Comb.
Mohammed M. M. Jaradat, Mohammad Saleh Bataineh, Tomás Vetrík, Ayat M. M. Rabaiah
2018 J jnl
General multiplicative Zagreb indices of trees.
Discret. Appl. Math.
Tomás Vetrík, Selvaraj Balachandran
2017 J jnl
Computing the metric dimension of the categorial product of some graphs.
Int. J. Comput. Math.
Tomás Vetrík, Ali Ahmad
2017 J jnl
Large Cayley digraphs and bipartite Cayley digraphs of odd diameters.
Discret. Math.
Marcel Abas, Tomás Vetrík
2017 J jnl
On the metric dimension of circulant graphs with $4$ generators.
Contributions Discret. Math.
Tomás Vetrík
2017 J jnl
The degree-diameter problem for outerplanar graphs.
Discuss. Math. Graph Theory
Peter Dankelmann, Elizabeth Jonck, Tomás Vetrík
2016 J jnl
The Gutman index and the edge-Wiener index of graphs with given vertex-connectivity.
Discuss. Math. Graph Theory
Jaya Percival Mazorodze, Simon Mukwembi, Tomás Vetrík
2014 J jnl
Abelian Cayley Graphs of Given Degree and Diameter 2 and 3.
Graphs Comb.
Tomás Vetrík
2014 J jnl
On the Gutman index and minimum degree.
Discret. Appl. Math.
Jaya Percival Mazorodze, Simon Mukwembi, Tomás Vetrík
2014 J jnl
The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs.
J. Graph Theory
Peter Dankelmann, Tomás Vetrík
2014 J jnl
Universal Graphs for Two Graph Properties.
Ars Comb.
Izak Broere, Tomás Vetrík
2013 J jnl
Cayley graphs of given degree and diameters 3, 4 and 5.
Discret. Math.
Tomás Vetrík
2012 J jnl
Large Cayley digraphs of given degree and diameter.
Discret. Math.
Tomás Vetrík
2012 J jnl
List coloring of complete multipartite graphs.
Discuss. Math. Graph Theory
Tomás Vetrík
2011 J jnl
Large bipartite Cayley graphs of given degree and diameter.
Discret. Math.
Tomás Vetrík, Rinovia Simanjuntak, Edy Tri Baskoro
2010 J jnl
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter.
J. Graph Theory
Heather Macbeth, Jana Siagiová, Jozef Sirán, Tomás Vetrík
2010 J jnl
On Ramsey
Discuss. Math. Graph Theory
Edy Tri Baskoro, Tomás Vetrík, Lyra Yulianti
2008 J jnl
An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles.
Discuss. Math. Graph Theory
Tomás Vetrík
2007 J jnl
Factorization of complete graphs into three factors with the smallest diameter equal to 3 or 4.
Australas. J Comb.
Tomás Vetrík
2007 J jnl
Large vertex-transitive and Cayley graphs with given degree and diameter.
Electron. Notes Discret. Math.
Jana Siagiová, Tomás Vetrík