Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Several Roman domina ...
Article

Several Roman domination graph invariants on Kneser graphs

Tatjana Zec, Milana Grbić ORCID
Download article
Open on arXiv
Submitted on
December 19, 2022
Accepted on
April 25, 2023
Published on
May 26, 2023
Last modified on
March 27, 2025
Volume 25
vol. 25:1
Graph Theory
DOI
10.46298/dmtcs.10506
License
arXiv.org - Non-exclusive license to distribute
Indicators
1376
Views
1554
Downloads

Several Roman domination graph invariants on Kneser graphs

Tatjana Zec, Milana Grbić ORCID
Abstract
This paper considers the following three Roman domination graph invariants on Kneser graphs: Roman domination, total Roman domination, and signed Roman domination. For Kneser graph $K_{n,k}$, we present exact values for Roman domination number $\gamma_{R}(K_{n,k})$ and total Roman domination number $\gamma_{tR}(K_{n,k})$ proving that for $n\geqslant k(k+1)$, $\gamma_{R}(K_{n,k}) =\gamma_{tR}(K_{n,k}) = 2(k+1)$. For signed Roman domination number $\gamma_{sR}(K_{n,k})$, the new lower and upper bounds for $K_{n,2}$ are provided: we prove that for $n\geqslant 12$, the lower bound is equal to 2, while the upper bound depends on the parity of $n$ and is equal to 3 if $n$ is odd, and equal to $5$ if $n$ is even. For graphs of smaller dimensions, exact values are found by applying exact methods from literature.
Keywords
  • Mathematics - Combinatorics
Mathematics Subject Classification 2020
  • 05C69 - Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Cited by

Source: OpenCitations

  • Total Perfect Roman Domination

    Symmetry

    Authors : Ahlam Almulhim ORCID

    Journal reference : Volume 15, 2023, pp. 1676

    DOI : 10.3390/sym15091676
  • Cost-Effective Network Optimization using Middle Weak Roman Domination with Python Integration

    2025 4th International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE)

    Authors : J. Meena ORCID, T. N. M. Malini Mai

    Journal reference : Volume , 2025, pp. 1-8

    DOI : 10.1109/icdcece65353.2025.11034808
  • Exploring Variant Roman Domination Number in Complete Binary Trees Using Python Programming

    2024 International Conference on Sustainable Communication Networks and Application (ICSCNA)

    Authors : J. Meena ORCID, T. N. M. Malini Mai

    Journal reference : Volume , 2024, pp. 568-575

    DOI : 10.1109/icscna63714.2024.10863879
  • Optimizing Communication in Complete Binary Trees Using Variant Double Roman Domination with Python-Based Pseudocode

    2025 8th International Conference on Trends in Electronics and Informatics (ICOEI)

    Authors : J. Meena ORCID, T. N. M. Malini Mai

    Journal reference : Volume , 2025, pp. 166-173

    DOI : 10.1109/icoei65986.2025.11013573
  • On double Roman domination problem for several graph classes

    Aequationes Mathematicae

    Authors : Tatjana Zec ORCID, Dragan Matić ORCID, Marko Djukanović

    Journal reference : Volume 99, 2024, pp. 439-463

    DOI : 10.1007/s00010-024-01071-3
Preview
Loading PDF preview...