R. M. Casablanca

activity

20182025

collaborators

3 papers

math.CO2025

p-Strong Roman Domination in Graphs

J. C. Valenzuela-Tripodoro, M. A. Mateos-Camacho, M. Cera +2

Domination in graphs is a widely studied field, where many different definitions have been introduced in the last years to respond to different network requirements. This paper pre…

math.CO2019

The maximum average connectivity among all orientations of a graph

Rocio M. Casablanca, Peter Dankelmann, Wayne Goddard +2

For distinct vertices $u$ and $v$ in a graph $G$ , the {\em connectivity} between $u$ and $v$ , denoted $κ_{G} (u, v)$ , is the maximum number of internally disjoint $u$ -- $v$ paths in $G$ …

math.CO2018

Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs

Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann

Let $G$ be a (multi)graph of order $n$ and let $u, v$ be vertices of $G$ . The maximum number of internally disjoint $u$ - $v$ paths in $G$ is denoted by $κ_{G} (u, v)$ , and the maximum nu…