A5021518367- Graph Labeling and Dimension Problems
- Human Rights and Immigration
- Advanced Graph Theory Research
- Social Sciences and Policies
- graph theory and CDMA systems
- Computational Geometry and Mesh Generation
- Administrative Law and Governance
- Graph theory and applications
- Archaeological and Historical Studies
- Complexity and Algorithms in Graphs
- Historical and socio-economic studies of Spain and related regions
- Limits and Structures in Graph Theory
- Cooperative Communication and Network Coding
- Interconnection Networks and Systems
- Photochromic and Fluorescence Chemistry
- Data Management and Algorithms
- Advanced Topology and Set Theory
- Media, Journalism, and Communication History
- Nuclear Receptors and Signaling
- Coding theory and cryptography
- Graph Theory and Algorithms
- Synthesis of Organic Compounds
- Digital Image Processing Techniques
- Advanced Numerical Analysis Techniques
- Developmental and Educational Neuropsychology
Universitat Politècnica de Catalunya
2015-2024
Universidad Politécnica de Madrid
2019-2020
Universidad de Zaragoza
2019-2020
Universidad Nacional de La Plata
2019
Universidad Autónoma Metropolitana
2016
Universidad Nacional Autónoma de México
2016
A set of vertices S resolves a graph G if every vertex is uniquely determined by its vector distances to the in S. The metric dimension minimum cardinality resolving G. This paper studies cartesian products $G\,\square\,H$. We prove that $G\,\square\,G$ tied strong sense order so‐called doubly Using bounds on sets, we establish $G\,\square\,H$ for many examples and H. One our main results family graphs with bounded which unbounded.
A set of vertices $S$ resolves a connected graph $G$ if every vertex is uniquely determined by its vector distances to the in $S$. The metric dimension minimum cardinality resolving $G$. Let ${\cal G}_{\beta,D}$ be graphs with $\beta$ and diameter $D$. It well-known that order exactly $\beta+D$. first contribution this paper characterise $\beta+D$ for all values Such characterisation was previously only known $D\leq2$ or $\beta\leq1$. second determine maximum $D$ $\beta$. Only weak upper bound known.
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then study 3-dimensional version problem enclose point with cone fixed apex angle α.
Limited dominating broadcasts were proposed as a variant of broadcasts, where the broadcast function is upper bounded. As natural extension domination, we consider 2-broadcasts along with associated parameter, 2-broadcast number. We prove that computing number NP-complete problem, but can be achieved in linear time for trees. also give an bound this tight graphs large desired.