Saved in:
| Main Authors: | Estrada-Moreno, Alejandro, Fernández, Elena, Kuziak, Dorota, Muñoz-Márquez, Manuel, Trujillo-Rasua, Rolando, Yero, Ismael G. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.08433 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the weak $k$-metric dimension of Hamming graphs
by: Fernandez, Elena, et al.
Published: (2025)
by: Fernandez, Elena, et al.
Published: (2025)
The weak $k$-metric dimension of the direct product of complete graphs
by: Farhan, Mohammad, et al.
Published: (2026)
by: Farhan, Mohammad, et al.
Published: (2026)
Coloring the vertices of a graph with mutual-visibility property
by: Klavžar, Sandi, et al.
Published: (2024)
by: Klavžar, Sandi, et al.
Published: (2024)
Universal cycle constructions for k-subsets and k-multisets
by: Campbell, Colin, et al.
Published: (2026)
by: Campbell, Colin, et al.
Published: (2026)
Complexity and equivalency of multiset dimension and ID-colorings
by: Hakanen, Anni, et al.
Published: (2023)
by: Hakanen, Anni, et al.
Published: (2023)
Moving through Cartesian products, coronas and joins in general position
by: Klavžar, Sandi, et al.
Published: (2025)
by: Klavžar, Sandi, et al.
Published: (2025)
A multiset approach to MacWilliams identities
by: Tang, Hopein Christofen
Published: (2025)
by: Tang, Hopein Christofen
Published: (2025)
Burning some myths on privacy properties of social networks against active attacks
by: Cicerone, Serafino, et al.
Published: (2025)
by: Cicerone, Serafino, et al.
Published: (2025)
General position problems in strong and lexicographic products of graphs
by: Dokyeesun, Pakanun, et al.
Published: (2024)
by: Dokyeesun, Pakanun, et al.
Published: (2024)
Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
by: Gabric, Daniel, et al.
Published: (2026)
by: Gabric, Daniel, et al.
Published: (2026)
Maker-Breaker resolving game played on corona products of graphs
by: James, Tijo, et al.
Published: (2024)
by: James, Tijo, et al.
Published: (2024)
Equidistant dimension of Cartesian product graphs
by: Gispert-Fernandez, Adria, et al.
Published: (2025)
by: Gispert-Fernandez, Adria, et al.
Published: (2025)
On lattice tilings of $\mathbb{Z}^n$ by limited magnitude error balls $\mathcal{B}(n,2,k_{1},k_{2})$ with $k_1>k_2$
by: Leung, Ka Hin, et al.
Published: (2025)
by: Leung, Ka Hin, et al.
Published: (2025)
Nonvanishing $k$-flats of Boolean and vectorial functions
by: Kaspers, Christian
Published: (2026)
by: Kaspers, Christian
Published: (2026)
Bounds on $k$-hash distances and rates of linear codes
by: Della Fiore, Stefano, et al.
Published: (2025)
by: Della Fiore, Stefano, et al.
Published: (2025)
Geometric construction of k-optimal locally repairable codes
by: Fu, Yi, et al.
Published: (2026)
by: Fu, Yi, et al.
Published: (2026)
On the independence number of de Bruijn graphs
by: Majer, Pietro, et al.
Published: (2026)
by: Majer, Pietro, et al.
Published: (2026)
Edge inducibility via local directed graphs
by: Chao, Ting-Wei, et al.
Published: (2025)
by: Chao, Ting-Wei, et al.
Published: (2025)
Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)
by: Fujii, Naoki
Published: (2025)
On the stabilizer of the graph of linear functions over finite fields
by: Smaldore, Valentino, et al.
Published: (2024)
by: Smaldore, Valentino, et al.
Published: (2024)
Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)
by: Abiad, Aida, et al.
Published: (2024)
Mutual-visibility in strong products of graphs via total mutual-visibility
by: Cicerone, Serafino, et al.
Published: (2022)
by: Cicerone, Serafino, et al.
Published: (2022)
Injective coloring of product graphs
by: Samadi, Babak, et al.
Published: (2023)
by: Samadi, Babak, et al.
Published: (2023)
An example showing that Schrijver's $\vartheta$-function need not upper bound the Shannon capacity of a graph
by: Sason, Igal
Published: (2025)
by: Sason, Igal
Published: (2025)
Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)
by: Dailly, Antoine, et al.
Published: (2025)
Identifying Young diagrams among residue multisets
by: Rostam, Salim
Published: (2020)
by: Rostam, Salim
Published: (2020)
Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
by: Gabrić, Daniel, et al.
Published: (2024)
by: Gabrić, Daniel, et al.
Published: (2024)
On the unicyclic graphs having vertices that belong to all their (strong) metric bases
by: Hakanen, Anni, et al.
Published: (2022)
by: Hakanen, Anni, et al.
Published: (2022)
Injective colorings of Sierpiński-like graphs and Kneser graphs
by: Brešar, Boštjan, et al.
Published: (2024)
by: Brešar, Boštjan, et al.
Published: (2024)
Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)
by: Mossel, Elchanan, et al.
Published: (2024)
Traversing a graph in general position
by: Klavžar, Sandi, et al.
Published: (2022)
by: Klavžar, Sandi, et al.
Published: (2022)
Storage codes on coset graphs with asymptotically unit rate
by: Barg, Alexander, et al.
Published: (2022)
by: Barg, Alexander, et al.
Published: (2022)
Trellis codes with a good distance profile constructed from expander graphs
by: Zhu, Yubin, et al.
Published: (2026)
by: Zhu, Yubin, et al.
Published: (2026)
Hilton-Milner theorem for $k$-multisets
by: Liao, Jiaqi, et al.
Published: (2023)
by: Liao, Jiaqi, et al.
Published: (2023)
The $k$-distance mutual-visibility problem in graphs
by: Cera, M., et al.
Published: (2024)
by: Cera, M., et al.
Published: (2024)
Independent mutual-visibility coloring and related concepts
by: Brešar, Boštjan, et al.
Published: (2025)
by: Brešar, Boštjan, et al.
Published: (2025)
On Vertices Contained in All or in No Metric Basis
by: Hakanen, Anni, et al.
Published: (2021)
by: Hakanen, Anni, et al.
Published: (2021)
On constrained intersection representations of graphs and digraphs
by: Cicalese, Ferdinando, et al.
Published: (2025)
by: Cicalese, Ferdinando, et al.
Published: (2025)
Upper bounds on the rate of linear $q$-ary $k$-hash codes
by: Della Fiore, Stefano, et al.
Published: (2024)
by: Della Fiore, Stefano, et al.
Published: (2024)
On tight $(k,\ell)$-stable graphs
by: Liu, Xiaonan, et al.
Published: (2024)
by: Liu, Xiaonan, et al.
Published: (2024)
Similar Items
-
On the weak $k$-metric dimension of Hamming graphs
by: Fernandez, Elena, et al.
Published: (2025) -
The weak $k$-metric dimension of the direct product of complete graphs
by: Farhan, Mohammad, et al.
Published: (2026) -
Coloring the vertices of a graph with mutual-visibility property
by: Klavžar, Sandi, et al.
Published: (2024) -
Universal cycle constructions for k-subsets and k-multisets
by: Campbell, Colin, et al.
Published: (2026) -
Complexity and equivalency of multiset dimension and ID-colorings
by: Hakanen, Anni, et al.
Published: (2023)