Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2510.02749

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2510.02749 (math)
[Submitted on 3 Oct 2025 ]

Title: On $d$-distance $p$-packing domination number in strong products

Title: 关于强积图中$d$-距离$p$-包装控制数

Authors:Csilla Bujtás, Vesna Iršič Chenoweth, Sandi Klavžar, Gang Zhang
Abstract: The $d$-distance $p$-packing domination number $\gamma_d^p(G)$ of a graph $G$ is the cardinality of a smallest set of vertices of $G$ which is both a $d$-distance dominating set and a $p$-packing. If no such set exists, then we set $\gamma_d^p(G) = \infty$. For an arbitrary strong product $G\boxtimes H$ it is proved that $\gamma_d^p(G\boxtimes H) \le \gamma_d^p(G) \gamma_d^p(H)$. By proving that $\gamma_d^p(P_m \boxtimes P_n) = \left \lceil \frac{m}{2d+1} \right \rceil \left \lceil \frac{n}{2d+1} \right \rceil$, and that if $\gamma_d^p(C_n) < \infty$, then $\gamma_d^p(P_m \boxtimes C_n) = \left \lceil \frac{m}{2d+1} \right \rceil \left \lceil \frac{n}{2d+1} \right \rceil$, the sharpness of the upper bound is demonstrated. On the other hand, infinite families of strong toruses are presented for which the strict inequality holds. For instance, we present strong toruses with difference $2$ and demonstrate that the difference can be arbitrarily large if only one factor is a cycle. It is also conjectured that if $\gamma_d^p(G) = \infty$, then $\gamma_d^p(G\boxtimes H) = \infty$ for every graph $H$. Several results are proved which support the conjecture, in particular, if $\gamma_d^p(C_m)= \infty$, then $\gamma_d^p(C_m \boxtimes C_n)=\infty$.
Abstract: 图 $G$ 的 $d$-距离 $p$-打包支配数 $\gamma_d^p(G)$ 是 $G$ 中一个最小顶点集合的基数,该集合既是 $d$-距离支配集,又是 $p$-打包。 如果不存在这样的集合,那么我们设置$\gamma_d^p(G) = \infty$。 对于任意的强积$G\boxtimes H$,证明了$\gamma_d^p(G\boxtimes H) \le \gamma_d^p(G) \gamma_d^p(H)$。 通过证明$\gamma_d^p(P_m \boxtimes P_n) = \left \lceil \frac{m}{2d+1} \right \rceil \left \lceil \frac{n}{2d+1} \right \rceil$,并且如果$\gamma_d^p(C_n) < \infty$,则$\gamma_d^p(P_m \boxtimes C_n) = \left \lceil \frac{m}{2d+1} \right \rceil \left \lceil \frac{n}{2d+1} \right \rceil$,从而展示了上界的有效性。 另一方面,给出了无限多个强环面族,其中严格不等式成立。 例如,我们给出了差值为$2$的强环面,并证明当只有一个因子是环时,差值可以无限大。 如果$\gamma_d^p(G) = \infty$,则对于每个图$H$,$\gamma_d^p(G\boxtimes H) = \infty$。 几个结果被证明支持该猜想,特别是如果$\gamma_d^p(C_m)= \infty$,则$\gamma_d^p(C_m \boxtimes C_n)=\infty$。
Subjects: Combinatorics (math.CO)
Cite as: arXiv:2510.02749 [math.CO]
  (or arXiv:2510.02749v1 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2510.02749
arXiv-issued DOI via DataCite

Submission history

From: Sandi Klavžar [view email]
[v1] Fri, 3 Oct 2025 06:24:22 UTC (20 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2025-10
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号