The following pages link to Ignacio M. Pelayo (Q324883):
Displaying 34 items.
- (Q283709) (redirect page) (← links)
- LD-graphs and global location-domination in bipartite graphs (Q283710) (← links)
- Quasiperfect domination in trees (Q324884) (← links)
- Diameter, short paths and superconnectivity in digraphs (Q704288) (← links)
- On the connectivity of cages with girth five, six and eight (Q878639) (← links)
- Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
- Using a progressive withdrawal procedure to study superconnectivity in digraphs (Q1394825) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- Neighbor-locating coloring: graph operations and extremal cardinalities (Q1792080) (← links)
- Every cubic cage is quasi 4-connected (Q1810654) (← links)
- Comment on ``The Steiner number of a graph'' by G. Chartrand and P. Zhang [Discrete Mathematics 242 (2002) 41--54] (Q1827687) (← links)
- Resolving dominating partitions in graphs (Q2026342) (← links)
- Neighbor-locating colorings in graphs (Q2285128) (← links)
- Extremal graph theory for metric dimension and diameter (Q2380462) (← links)
- Locating domination in bipartite graphs and their complements (Q2420423) (← links)
- Nordhaus-Gaddum bounds for locating domination (Q2441609) (← links)
- (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected (Q2569934) (← links)
- Geodesic Convexity in Graphs (Q2849538) (← links)
- On global location-domination in graphs (Q2950079) (← links)
- (Q3004143) (← links)
- Every Cubic Cage is quasi 4-connected (Q3438985) (← links)
- On the metric dimension of some families of graphs (Q3439322) (← links)
- Some structural, metric and convex properties on the boundary of a graph (Q3439437) (← links)
- Extremal Graph Theory for Metric Dimension and Diameter (Q3503491) (← links)
- (Q3625873) (← links)
- Superconnected digraphs and graphs with small conditional diameters (Q4537622) (← links)
- General bounds on limited broadcast domination (Q4560266) (← links)
- On perfect and quasiperfect dominations in graphs (Q5005483) (← links)
- Perfect and quasiperfect domination in trees (Q5279867) (← links)
- (Q5506524) (← links)
- Some product graphs with power dominating number at most 2 (Q5861699) (← links)
- The Neighbor-Locating-Chromatic Number of Pseudotrees (Q6316336) (← links)
- Metric Location in Pseudotrees: A survey and new results (Q6512158) (← links)
- Reconstructing a pseudotree from the distance matrix of its boundary (Q6529357) (← links)
