arXiv (All)
open access
Weak $k$-metric dimension of Hamming graphs: rectangular products and near-maximum parameters
We determine weak $k$-metric dimensions for several families of Hamming graphs. For $n\ge3$, $m>n$, and $3\le k\le2n$, a cyclic construction proves Conjecture 6.1 of Fernández, Klavžar, Kuziak, Muñoz-Márquez and Yero (2026) on $K_n\square K_m$. For these rectangular products, we also prove that $\op
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Exact majority C-colourings of balanced Hamming graphs and grids#1115630
- Maximum number of spanning trees in bipartite graphs with a given diameter#1109503
- Edge ideals of complements of a class of circular interval graphs#1105663
- Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs#927302
- Minimum enclosing Bregman balls made easy#925214
Record · ID 1116492
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive