| On the Metric Representation of the Vertices of a Graph |
|
| A New Tool for the Teaching of Graph Theory: Identification of Commognitive Conflicts |
|
| The 2-domination number of cylindrical graphs |
|
| A theoretical analysis of the validity of the Van Hiele levels of reasoning in graph theory |
|
| Analizando perfiles de reconocimiento en teoría de grafos |
|
| HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs |
|
| Proof levels of graph theory students under the lens of the Van Hiele model |
|
| On the 2-domination Number of Cylinders with Small Cycles |
|
| On the 2-Packing Differential of a Graph |
|
| Powers of Large Matrices on GPU Platforms to Compute the Roman Domination Number of Cylindrical Graphs |
|
| Characterizing Levels of Reasoning in Graph Theory |
|
| Elimination Properties for Minimal Dominating Sets of Graphs |
|
| On the Metric Dimensions for Sets of Vertices |
|
| A General Lower Bound for the Domination Number of Cylindrical Graphs |
|
| Every grid has an independent [1,2]-set |
|
| Robust observer design by sign-stability for the monitoring of population systems |
|
| Removing Twins in Graphs to Break Symmetries |
|
| Removing twins in graphs to break symmetries |
|
| On stronger types of locating-dominating codes |
|
| ON THE BOUNDARY AS AN x-GEODOMINATING SET IN GRAPHS |
|
| Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs |
|
| Strong resolving graphs: The realization and the characterization problems |
|
| Shortcut sets for the locus of plane Euclidean networks |
|
| On independent [1, 2]-sets in trees |
|
| General bounds on limited broadcast domination |
|
| Efficient location of resources in cylindrical networks |
|
| Efficient Location of Resources in Cylindrical Networks |
|
| Independent [1,2]-number versus independent domination number |
|
| On perfect and quasiperfect dominations in graphs |
|
| Perfect and quasiperfect domination in trees |
|
| Independent [1, 2]-domination of grids via min-plus algebra |
|
| Shortcut sets for plane Euclidean networks (Extended abstract) |
|
| Quasiperfect Domination in Trees |
|
| The graph distance game and some graph operations |
|
| Locating-dominating codes: Bounds and extremal cardinalities |
|
| The determining number of Kneser graphs |
|
| Resolving sets for Johnson and Kneser graphs |
|
| Graph operations and Lie algebras |
|
| Combinatorial structures of three vertices and Lie algebras |
|
| On the metric dimension of infinite graphs |
|
| On the metric dimension of infinite graphs |
|
| MINIMAL TREES AND MONOPHONIC CONVEXITY |
|
| Towards a new framework for domination |
|
| On the determining number and the metric dimension of graphs |
|
| On the geodetic and the hull numbers in strong product graphs |
|
| Steiner distance and convexity in graphs |
|
| Geodeticity of the contour of chordal graphs |
|
| On the metric dimension of cartesian products of graphs |
|
| Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs |
|
| On geodetic sets formed by boundary vertices |
|
| Rebuilding convex sets in graphs |
|
| On the metric dimension of some families of graphs |
|
| Fenestrations induced by perfect tilings |
|
| Tietze's extension Theorem,El Teorema de extensión de Tietze |
|
| Ordered fractal semigroups as a model of computation |
|
| Symmetric products and social choice |
|
| Transfinite extension of Steinke's dimension |
|
| Idealization of some weak separation axioms |
|
| Unification approach to the separation axioms between T<inf>0</inf> and completely Hausdorff |
|
| A new kind of infinite dimensional spaces |
|
| Transfinite order dimension |
|
