A5055837693- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- graph theory and CDMA systems
- Interconnection Networks and Systems
- Graph theory and applications
- Complexity and Algorithms in Graphs
- Computational Geometry and Mesh Generation
- Limits and Structures in Graph Theory
- Coding theory and cryptography
- Cooperative Communication and Network Coding
- Finite Group Theory Research
- Advanced Topology and Set Theory
- Higher Education Teaching and Evaluation
- Photochromic and Fluorescence Chemistry
- E-Learning and Knowledge Management
- Educational Technology in Learning
- Matrix Theory and Algorithms
- Color perception and design
- Optimization and Search Problems
- Rings, Modules, and Algebras
- Nuclear Receptors and Signaling
- Developmental and Educational Neuropsychology
- Synthesis of Organic Compounds
- Engineering and Information Technology
- Game Theory and Applications
Universitat Politècnica de Catalunya
2012-2025
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.
This paper presents a comprehensive review of the literature on original concept metric location, along with its various adaptations and extensions that have been developed over time. Given determining minimum location set is generally NP-hard, we focus analyzing behavior these sets within specific graph families, including paths, cycles, trees unicyclic graphs. In addition to synthesizing existing knowledge, contribute new findings insights field, advancing understanding problems in...
Let G be a digraph, LG its line digraph and A(G) A(LG) their adjacency matrices. We present relations between the Jordan Normal Form of these two In addition, we study spectra those matrices obtain relationship characteristic polynomials that allows us to relate properties LG, specifically number cycles given length.
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.