Juan Carlos Valenzuela-Tripodoro

Dr. Juan Carlos Valenzuela-Tripodoro

Department of Mathematics, Universidad de Cádiz, Cádiz, Andalusia, Spain
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2009 in Discrete Mathematics
Verified
Journal Article
Closed access
GAG. Araujo-Pardo
G. Araujo-Pardo
CBC. Balbuena
C. Balbuena
Juan Carlos Valenzuela-TripodoroJuan Carlos Valenzuela-Tripodoro
Juan Carlos Valenzuela-Tripodoro

1 June 2008 in Discrete Mathematics
Verified
Journal Article
Closed access
GAG. Araujo-Pardo
G. Araujo-Pardo
CBC. Balbuena
C. Balbuena
PGPedro García-Vázquez
Pedro García-Vázquez
XMX. Marcote
X. Marcote
Juan Carlos Valenzuela-TripodoroJuan Carlos Valenzuela-Tripodoro
Juan Carlos Valenzuela-Tripodoro

1 January 2020 in Discussiones Mathematicae Graph Theory
Verified
Journal Article
Open access
HAHossein Abdollahzadeh Ahangar
Hossein Abdollahzadeh Ahangar
MCMustapha Chellali
Mustapha Chellali
SSSeyed Mahmoud Sheikholeslami
Seyed Mahmoud Sheikholeslami
Juan Carlos Valenzuela-TripodoroJuan Carlos Valenzuela-Tripodoro
Juan Carlos Valenzuela-Tripodoro

27 March 2024 in Bulletin of the Iranian Mathematical Society
Verified
Journal Article
Open access
PDF file
Juan Carlos Valenzuela-TripodoroJuan Carlos Valenzuela-Tripodoro
Juan Carlos Valenzuela-Tripodoro
MCMª Antonia Mateos Camacho
Mª Antonia Mateos Camacho
Martin CeraMartin Cera
Martin Cera
MRMaría del Pilar Alvarez Ruiz
María del Pilar Alvarez Ruiz
In 2016, Beeler et al. defined the double Roman domination as a variation of Roman domination. Sometime later, in 2021, Ahangar et al. introduced the concept of [k]-Roman domination in graphs and settled some results on the triple Roman domination case. In 2022, Amjadi et al. studied the quadruple version of this Roman-domination-type problem. Given any labeling of the vertices of a graph, AN(v) stands for the set of neighbors of a vertex v having a positive label. In this paper we continue the study of the [k]-Roman domination functions ([k]-RDF) in graphs which coincides with the previous versions when $$2\le k \le 4$$ 2 ≤ k ≤ 4 . Namely, f is a [k]-RDF if $$f(N[v])\ge k+|AN(v)|$$ f ( N [ v ] ) ≥ k + | A N ( v ) | for all v. We prove that the associate decision problem is NP-complete even when restricted to star convex and comb convex bipartite graphs and we also give sharp bounds and exact values for several classes of graphs.

1 August 2007 in Discrete Mathematics
Verified
Journal Article
Closed access
CBC. Balbuena
C. Balbuena
PGPedro García-Vázquez
Pedro García-Vázquez
XMX. Marcote
X. Marcote
Juan Carlos Valenzuela-TripodoroJuan Carlos Valenzuela-Tripodoro
Juan Carlos Valenzuela-Tripodoro

1 April 2007 in Applied Mathematics Letters
Verified
Journal Article
Closed access
CBC. Balbuena
C. Balbuena
PGPedro García-Vázquez
Pedro García-Vázquez
XMX. Marcote
X. Marcote
Juan Carlos Valenzuela-TripodoroJuan Carlos Valenzuela-Tripodoro
Juan Carlos Valenzuela-Tripodoro