The following pages link to Ismael González Yero (Q244945):
Displaying 50 items.
- The \(k\)-metric dimension of the lexicographic product of graphs (Q279212) (← links)
- \(k\)-metric resolvability in graphs (Q283685) (← links)
- On the strong metric dimension of product graphs (Q283695) (← links)
- The security number of strong grid-like graphs (Q329713) (← links)
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
- Coloring, location and domination of corona graphs (Q372395) (← links)
- The partition dimension of strong product graphs and Cartesian product graphs (Q397144) (← links)
- (Q400430) (redirect page) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- On the strong partition dimension of graphs (Q405298) (← links)
- On the Randić index of corona product graphs (Q410644) (← links)
- (Q503628) (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)
- On the independence transversal total domination number of graphs (Q505424) (← links)
- Vertices, edges, distances and metric dimension in graphs (Q510989) (← links)
- Resolvability and strong resolvability in the direct product of graphs (Q511842) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← 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)
- The \(k\)-metric dimension of corona product graphs (Q726506) (← links)
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- Defensive \(k\)-alliances in graphs (Q1027474) (← links)
- The fractional strong metric dimension in three graph products (Q1627860) (← links)
- Uniquely identifying the edges of a graph: the edge metric dimension (Q1627862) (← links)
- The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity (Q1680878) (← links)
- Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- Error-correcting codes from \(k\)-resolving sets (Q1717187) (← links)
- Computing the \(k\)-metric dimension of graphs (Q1735142) (← links)
- Mixed metric dimension of graphs (Q1740116) (← links)
- \(k\)-metric antidimension: a privacy measure for social graphs (Q1750516) (← links)
- Computing global offensive alliances in Cartesian product graphs (Q1759887) (← 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)
- Edge metric dimension of some graph operations (Q1988561) (← links)
- On general position sets in Cartesian products (Q2041227) (← links)
- Maker-breaker resolving game (Q2045245) (← links)
- Further results on packing related parameters in graphs (Q2118231) (← links)
- Relating the outer-independent total Roman domination number with some classical parameters of graphs (Q2141037) (← links)
- On vertices contained in all or in no metric basis (Q2161262) (← links)
- A note on the metric and edge metric dimensions of 2-connected graphs (Q2161264) (← links)
- On the outer independent double Roman domination number (Q2169279) (← links)
- Further new results on strong resolving partitions for graphs (Q2189231) (← links)
- Independent transversal total domination versus total domination in trees (Q2214318) (← links)
- A constructive characterization of vertex cover Roman trees (Q2214322) (← links)
