J. A. Rodríguez-Velázquez

most citedDefensive k-alliances in graphs

33 citations · 39 across the 3 of their papers we have counts for

collaborators

5 papers

math.CO2006★ 33 cited

Defensive k-alliances in graphs

J. A. Rodriguez-Velazquez, I. G. Yero, J. M. Sigarreta

Let $Γ = (V, E)$ be a simple graph. For a nonempty set $X \subseteq V$ , and a vertex $v \in V$ , $δ_{X} (v)$ denotes the number of neighbors $v$ has in $X$ . A nonempty set $S \subseteq V$ …

math.CO2006★ 6 cited

Spectral study of alliances in graphs

J. A. Rodriguez, J. M. Sigarreta

In this paper we obtain several tight bounds on different types of alliance numbers of a graph: (global) defensive alliance number, global offensive alliance number and global dual…

math.CO2006

On defensive alliances and line graphs

J. M. Sigarreta, J. A. Rodriguez

Let $Γ$ be a simple graph of size $m$ and degree sequence $δ_{1} \geq δ_{2} \geq ... \geq δ_{n}$ . Let $L (Γ)$ denotes the line graph of $Γ$ . The aim of this paper is to study mathematic…

cond-mat.stat-mech2005

Subgraph Centrality in Complex Networks

Ernesto Estrada, Juan A. Rodriguez-Velazquez

We introduce a new centrality measure that characterizes the participation of each node in all subgraphs in a network. Smaller subgraphs are given more weight than larger ones, whi…

cond-mat.stat-mech2005

Spectral Measures of Bipartivity in Complex Networks

Ernesto Estrada, Juan A. Rodriguez-Velazquez

We introduce a quantitative measure of network bipartivity as a proportion of even to total number of closed walks in the network. Spectral graph theory is used to quantify how clo…