The following pages link to Juan Alberto Rodríguez-Velázquez (Q979916):
Displaying 50 items.
- (Q279211) (redirect page) (← links)
- The \(k\)-metric dimension of the lexicographic product of graphs (Q279212) (← links)
- Closed formulae for the local metric dimension of corona product graphs (Q283660) (← links)
- \(k\)-metric resolvability in graphs (Q283685) (← links)
- On the strong metric dimension of product graphs (Q283695) (← links)
- Simultaneous resolvability in graph families (Q283715) (← links)
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
- The simultaneous metric dimension of families composed by lexicographic product graphs (Q343771) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- On the Randić index of corona product graphs (Q410644) (← links)
- (Q503629) (redirect page) (← links)
- Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs (Q503630) (← links)
- Computing the metric dimension of a graph from primary subgraphs (Q503686) (← links)
- Partitioning a graph into defensive \(k\)-alliances (Q546272) (← links)
- On global offensive \(k\)-alliances in graphs (Q602832) (← links)
- A note on the partition dimension of Cartesian product graphs (Q613309) (← links)
- Partitioning a graph into offensive \(k\)-alliances (Q629362) (← links)
- On the metric dimension of corona product graphs (Q639103) (← links)
- Boundary defensive \(k\)-alliances in graphs (Q708358) (← links)
- Simultaneous resolvability in families of corona product graphs (Q723627) (← links)
- The \(k\)-metric dimension of corona product graphs (Q726506) (← links)
- On the local metric dimension of corona product graphs (Q726508) (← links)
- The simultaneous strong metric dimension of graph families (Q726509) (← links)
- The Hosoya polynomial of distance-regular graphs (Q741545) (← links)
- Double domination in lexicographic product graphs (Q777395) (← links)
- The simultaneous metric dimension of graph families (Q897612) (← links)
- Weak total resolvability in graphs (Q907841) (← links)
- On reliability indices of communication networks (Q979918) (← links)
- Global defensive \(k\)-alliances in graphs (Q1003661) (← links)
- Laplacian eigenvalues and partition problems in hypergraphs (Q1023080) (← links)
- Defensive \(k\)-alliances in graphs (Q1027474) (← links)
- (Q1297415) (redirect page) (← links)
- Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods (Q1297416) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- Computing the \(k\)-metric dimension of graphs (Q1735142) (← links)
- The limit case of a domination property (Q1758000) (← links)
- Computing global offensive alliances in Cartesian product graphs (Q1759887) (← links)
- A spectral approach to the Randić index (Q1779272) (← links)
- Partitioning a graph into global powerful \(k\)-alliances (Q1926038) (← links)
- On the strong metric dimension of corona product graphs and join graphs (Q1949107) (← links)
- Secure domination in rooted product graphs (Q2025078) (← links)
- Secure Italian domination in graphs (Q2025095) (← links)
- A note on double domination in graphs (Q2030253) (← links)
- On the 2-packing differential of a graph (Q2044595) (← links)
- Protection of lexicographic product graphs (Q2062678) (← links)
- Solution of the Chen-Chvátal conjecture for specific classes of metric spaces (Q2130816) (← links)
- Weak Roman domination in rooted product graphs (Q2144851) (← links)
- Total protection of lexicographic product graphs (Q2151225) (← links)
- Italian domination in rooted product graphs (Q2227964) (← links)
