default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Vetrík
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j36]Tomás Vetrík
:
Degree-based function index for graphs with given diameter. Discret. Appl. Math. 333: 59-70 (2023)- [j35]Tomás Vetrík, Mesfin Masre, Selvaraj Balachandran:
Eccentric connectivity coindex of bipartite graphs. Discret. Math. Algorithms Appl. 15(1): 2250054:1-2250054:11 (2023) - [j34]Tomás Vetrík:
General Randić index of trees with given number of branching vertices. Discret. Math. Algorithms Appl. 15(4): 2250107:1-2250107:12 (2023) - [j33]Tomás Vetrík:
General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index. Electron. J. Graph Theory Appl. 11(1): 125-133 (2023) - 2022
- [j32]Monther Rashed Alfuraidan, Kinkar Chandra Das, Tomás Vetrík, Selvaraj Balachandran:
General Randić index of unicyclic graphs with given diameter. Discret. Appl. Math. 306: 7-16 (2022) - [j31]Tomás Vetrík:
General sum-connectivity index of unicyclic graphs with given diameter and girth. Discret. Math. Algorithms Appl. 14(4): 2150140:1-2150140:9 (2022) - [j30]Tomás Vetrík, Mesfin Masre, Selvaraj Balachandran:
Zeroth-order general Randić index of trees with given distance k-domination number. Electron. J. Graph Theory Appl. 10(1): 247 (2022) - 2021
- [j29]Monther Rashed Alfuraidan, Kinkar Chandra Das, Tomás Vetrík, Selvaraj Balachandran:
General sum-connectivity index of unicyclic graphs with given diameter. Discret. Appl. Math. 295: 39-46 (2021) - [j28]Tomás Vetrík:
General eccentric distance sum of graphs. Discret. Math. Algorithms Appl. 13(4): 2150046:1-2150046:17 (2021) - 2020
- [j27]Monther Rashed Alfuraidan, Muhammad Imran, Muhammad Kamran Jamil, Tomás Vetrík:
General Multiplicative Zagreb Indices of Graphs With Bridges. IEEE Access 8: 118725-118731 (2020) - [j26]Tomás Vetrík, Mesfin Masre:
General eccentric connectivity index of trees and unicyclic graphs. Discret. Appl. Math. 284: 301-315 (2020) - [j25]Mesfin Masre, Samuel Asefa Fufa, Tomás Vetrík:
Distance-based indices of complete m-ary trees. Discret. Math. Algorithms Appl. 12(4): 2050041:1-2050041:22 (2020) - [j24]Tomás Vetrík:
On the metric dimension of directed and undirected circulant graphs. Discuss. Math. Graph Theory 40(1): 67-76 (2020) - [j23]Tomás Vetrík, Selvaraj Balachandran:
General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number. J. Comb. Optim. 40(4): 953-973 (2020) - [j22]Monther R. Alfuraidan, Tomás Vetrík, Selvaraj Balachandran:
General Multiplicative Zagreb Indices of Graphs with a Small Number of Cycles. Symmetry 12(4): 514 (2020) - [j21]Marcel Abas, Tomás Vetrík:
Metric dimension of Cayley digraphs of split metacyclic groups. Theor. Comput. Sci. 809: 61-72 (2020)
2010 – 2019
- 2018
- [j20]Mohammed M. M. Jaradat, Mohammad Saleh Bataineh, Tomás Vetrík, Ayat M. M. Rabaiah:
A note on the Ramsey numbers for theta graphs versus the wheel of order 5. AKCE Int. J. Graphs Comb. 15(2): 187-189 (2018) - [j19]Tomás Vetrík, Selvaraj Balachandran:
General multiplicative Zagreb indices of trees. Discret. Appl. Math. 247: 341-351 (2018) - 2017
- [j18]Tomás Vetrík:
On the metric dimension of circulant graphs with $4$ generators. Contributions Discret. Math. 12(2) (2017) - [j17]Marcel Abas, Tomás Vetrík:
Large Cayley digraphs and bipartite Cayley digraphs of odd diameters. Discret. Math. 340(6): 1162-1171 (2017) - [j16]Peter Dankelmann, Elizabeth Jonck, Tomás Vetrík:
The degree-diameter problem for outerplanar graphs. Discuss. Math. Graph Theory 37(3): 823-834 (2017) - [j15]Tomás Vetrík, Ali Ahmad:
Computing the metric dimension of the categorial product of some graphs. Int. J. Comput. Math. 94(2): 363-371 (2017) - 2016
- [j14]Jaya Percival Mazorodze, Simon Mukwembi, Tomás Vetrík:
The Gutman index and the edge-Wiener index of graphs with given vertex-connectivity. Discuss. Math. Graph Theory 36(4): 867-876 (2016) - 2014
- [j13]Izak Broere, Tomás Vetrík:
Universal Graphs for Two Graph Properties. Ars Comb. 116: 257-262 (2014) - [j12]Jaya Percival Mazorodze, Simon Mukwembi, Tomás Vetrík:
On the Gutman index and minimum degree. Discret. Appl. Math. 173: 77-82 (2014) - [j11]Tomás Vetrík:
Abelian Cayley Graphs of Given Degree and Diameter 2 and 3. Graphs Comb. 30(6): 1587-1591 (2014) - [j10]Peter Dankelmann, Tomás Vetrík:
The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs. J. Graph Theory 75(2): 105-123 (2014) - 2013
- [j9]Tomás Vetrík:
Cayley graphs of given degree and diameters 3, 4 and 5. Discret. Math. 313(3): 213-216 (2013) - 2012
- [j8]Tomás Vetrík:
Large Cayley digraphs of given degree and diameter. Discret. Math. 312(2): 472-475 (2012) - [j7]Tomás Vetrík:
List coloring of complete multipartite graphs. Discuss. Math. Graph Theory 32(1): 31-37 (2012) - 2011
- [j6]Tomás Vetrík, Rinovia Simanjuntak, Edy Tri Baskoro:
Large bipartite Cayley graphs of given degree and diameter. Discret. Math. 311(4): 324-326 (2011) - 2010
- [j5]Edy Tri Baskoro, Tomás Vetrík, Lyra Yulianti:
On Ramsey (K1, 2, C4)-minimal graphs. Discuss. Math. Graph Theory 30(4): 637-649 (2010) - [j4]Heather Macbeth, Jana Siagiová, Jozef Sirán, Tomás Vetrík:
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter. J. Graph Theory 64(2): 87-98 (2010)
2000 – 2009
- 2008
- [j3]Tomás Vetrík:
An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles. Discuss. Math. Graph Theory 28(1): 91-96 (2008) - 2007
- [j2]Tomás Vetrík:
Factorization of complete graphs into three factors with the smallest diameter equal to 3 or 4. Australas. J Comb. 39: 183-190 (2007) - [j1]Jana Siagiová, Tomás Vetrík:
Large vertex-transitive and Cayley graphs with given degree and diameter. Electron. Notes Discret. Math. 28: 365-369 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
