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:2406.02259

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2406.02259 (math)
[Submitted on 4 Jun 2024 ]

Title: Restricted SDC Edge Cover Pebbling Number

Title: 限制SDC边覆盖钉数

Authors:A. Lourdusamy, F. Joy Beaula, F. Patrick, I. Dhivviyanandam
Abstract: The restricted edge pebbling distribution is a distribution of pebbles on the edges of $G$ is the placement of pebbles on the edges with the restriction that only an even number of pebbles should be placed on the edges with labels $0$. Given an SDC labeling of $G$, the restricted SDC edge cover pebbling number of a graph $G$, $\psi_{EC}(G)$, is the least positive integer $m$ for which any restricted edge pebbling distribution of $m$ pebbles such that at the end there are no pebbles on the edges having label $0$ will allow the shifting of a pebble simultaneously to all edges with label $1$ using a sequence of restricted edge pebbling moves. We compute the restricted SDC edge cover pebbling number for some graphs
Abstract: 受限边 Pebbling 分布是将 Pebbles 放置在$G$的边上的分布,其限制条件是仅允许在标签为$0$的边上放置偶数个 Pebbles。 给定一个$G$的 SDC 标签,图$G$,$\psi_{EC}(G)$的限制 SDC 边覆盖 Pebbling 数是满足任何限制边 Pebbling 分布的$m$个 Pebbles,在最后边标签为$0$的边上没有 Pebbles 的情况下,可以使用一系列限制边 Pebbling 移动同时将一个 Pebble 移动到所有标签为$1$的边上的最小正整数$m$。我们计算了一些图的限制 SDC 边覆盖 Pebbling 数。
Comments: 9
Subjects: Combinatorics (math.CO) ; Number Theory (math.NT)
MSC classes: 05C99, 05C78
ACM classes: F.2.2
Cite as: arXiv:2406.02259 [math.CO]
  (or arXiv:2406.02259v1 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2406.02259
arXiv-issued DOI via DataCite

Submission history

From: Dhivviyanandam I [view email]
[v1] Tue, 4 Jun 2024 12:31:18 UTC (7 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2024-06
Change to browse by:
math
math.NT

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号