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:2306.01488v1

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2306.01488v1 (math)
[Submitted on 2 Jun 2023 ]

Title: Injective coloring of product graphs

Title: 可注入着色的乘积图

Authors:Babak Samadi, Nasrin Soltankhah, Ismael G. Yero
Abstract: The problem of injective coloring in graphs can be revisited through two different approaches: coloring the two-step graphs and vertex partitioning of graphs into open packing sets, each of which is equivalent to the injective coloring problem itself. Taking these facts into account, we observe that the injective coloring lies between graph coloring and domination theory. We make use of these three points of view in this paper so as to investigate the injective coloring of some well-known graph products. We bound the injective chromatic number of direct and lexicographic product graphs from below and above. In particular, we completely determine this parameter for the direct product of two cycles. We also give a closed formula for the corona product of two graphs.
Abstract: 图的注入着色问题可以通过两种不同的方法重新审视:对两步图进行着色以及将图的顶点划分为开包装集,每种方法都等价于注入着色问题本身。 考虑到这些事实,我们观察到注入着色介于图着色和支配理论之间。 在本文中,我们利用这三个观点来研究一些著名图积的注入着色。 我们从下限和上限两个方面界定了直接积和字典积图的注入色数。 特别是,我们完全确定了两个环的直接积的该参数。 我们还给出了两个图的冠积的闭式公式。
Subjects: Combinatorics (math.CO)
MSC classes: 05C15, 05C69, 05C76
Cite as: arXiv:2306.01488 [math.CO]
  (or arXiv:2306.01488v1 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2306.01488
arXiv-issued DOI via DataCite
Journal reference: Bulletin of the Malaysian Mathematical Sciences Society, 2024
Related DOI: https://doi.org/10.1007/s40840-024-01682-8
DOI(s) linking to related resources

Submission history

From: Babak Samadi [view email]
[v1] Fri, 2 Jun 2023 12:24:25 UTC (17 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2023-06
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号