Tomás Vetrík

Orcid: 0000-0002-0387-7276

According to our database1, Tomás Vetrík authored at least 36 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Degree-based function index for graphs with given diameter.
Discret. Appl. Math., July, 2023

General Randić index of trees with given number of branching vertices.
Discret. Math. Algorithms Appl., May, 2023

Eccentric connectivity coindex of bipartite graphs.
Discret. Math. Algorithms Appl., January, 2023

General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index.
Electron. J. Graph Theory Appl., 2023

2022
Zeroth-order general Randić index of trees with given distance k-domination number.
Electron. J. Graph Theory Appl., 2022

General sum-connectivity index of unicyclic graphs with given diameter and girth.
Discret. Math. Algorithms Appl., 2022

General Randić index of unicyclic graphs with given diameter.
Discret. Appl. Math., 2022

2021
General eccentric distance sum of graphs.
Discret. Math. Algorithms Appl., 2021

General sum-connectivity index of unicyclic graphs with given diameter.
Discret. Appl. Math., 2021

2020
Metric dimension of Cayley digraphs of split metacyclic groups.
Theor. Comput. Sci., 2020

General Multiplicative Zagreb Indices of Graphs with a Small Number of Cycles.
Symmetry, 2020

General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number.
J. Comb. Optim., 2020

On the metric dimension of directed and undirected circulant graphs.
Discuss. Math. Graph Theory, 2020

Distance-based indices of complete m-ary trees.
Discret. Math. Algorithms Appl., 2020

General eccentric connectivity index of trees and unicyclic graphs.
Discret. Appl. Math., 2020

General Multiplicative Zagreb Indices of Graphs With Bridges.
IEEE Access, 2020

2018
General multiplicative Zagreb indices of trees.
Discret. Appl. Math., 2018

A note on the Ramsey numbers for theta graphs versus the wheel of order 5.
AKCE Int. J. Graphs Comb., 2018

2017
Computing the metric dimension of the categorial product of some graphs.
Int. J. Comput. Math., 2017

The degree-diameter problem for outerplanar graphs.
Discuss. Math. Graph Theory, 2017

Large Cayley digraphs and bipartite Cayley digraphs of odd diameters.
Discret. Math., 2017

On the metric dimension of circulant graphs with $4$ generators.
Contributions Discret. Math., 2017

2016
The Gutman index and the edge-Wiener index of graphs with given vertex-connectivity.
Discuss. Math. Graph Theory, 2016

2014
The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs.
J. Graph Theory, 2014

Abelian Cayley Graphs of Given Degree and Diameter 2 and 3.
Graphs Comb., 2014

On the Gutman index and minimum degree.
Discret. Appl. Math., 2014

Universal Graphs for Two Graph Properties.
Ars Comb., 2014

2013
Cayley graphs of given degree and diameters 3, 4 and 5.
Discret. Math., 2013

2012
List coloring of complete multipartite graphs.
Discuss. Math. Graph Theory, 2012

Large Cayley digraphs of given degree and diameter.
Discret. Math., 2012

2011
Large bipartite Cayley graphs of given degree and diameter.
Discret. Math., 2011

2010
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter.
J. Graph Theory, 2010

On Ramsey <i>(K<sub>1, 2</sub>, C<sub>4</sub>)</i>-minimal graphs.
Discuss. Math. Graph Theory, 2010

2008
An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles.
Discuss. Math. Graph Theory, 2008

2007
Large vertex-transitive and Cayley graphs with given degree and diameter.
Electron. Notes Discret. Math., 2007

Factorization of complete graphs into three factors with the smallest diameter equal to 3 or 4.
Australas. J Comb., 2007


  Loading...