3 papers
cs.DM2025
Roman domination in weighted graphs
MartÃn Cera, Pedro GarcÃa-Vázquez, Juan Carlos Valenzuela-Tripodoro
A Roman dominating function for a (non-weighted) graph , is a function such that every vertex with has at least {one} neighbor…
math.GM2024
Strong Edge-Based Roman Domination in Fuzzy Graphs
M. Cera, P. Garcia-Vazquez, J. C. Valenzuela-Tripodoro
This work is related to the extension of the well-known problem of Roman domination in graph theory to fuzzy graphs. A variety of approaches have been used to explore the concept o…
math.CO2024
The -distance mutual-visibility problem in graphs
M. Cera, P. Garcia-Vazquez, J. C. Valenzuela-Tripodoro +1
The concept of mutual visibility in graphs, introduced recently, addresses a fundamental problem in Graph Theory concerning the identification of the largest set of vertices in a g…