Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 19 min ago
PreprintCC BY 4.0arXiv

Independent domination in central graphs

  • Abel Cabrera-Martínez
  • José Luis López-Carmona
  • Ismael Rios-Villamar
  • Alejandro Serrano-Díaz
Open at sourcePDFDOICite

Abstract

Let G be a graph with vertex set V(G). A set I⊆ V(G) is an independent dominating set of G if no two vertices in I are adjacent and every vertex in V(G)∖ I is adjacent to at least one vertex in I. The independent domination number of G is the minimum cardinality among all independent dominating sets of G. The aim of this article is to obtain tight bounds and closed formulas for the independent domination number of central graphs. The results are expressed in terms of parameters of the original graph from which the central graph is constructed.

Related

  1. On the (independent) semitotal domination in subdivision, middle, and central graphs
    Abel Cabrera-Martínez, José Luis López-Carmona, Ismael Rios-Villamar +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Bounds for the ratio between the independent domination number and the domination number
    Gunnar Brinkmann, Steven Van Overberghe
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Domination and Total Domination in Johnson graphs
    María Gracia Cornet, Tanja Dravec, Pablo Torres
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. The domination number of the $2$-token graph of path graphs
    Emmanuel Acosta Troncoso, Luis Manuel Rivera
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. On graphs with equal domination and total domination numbers
    Sudip Bera
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{cabreramartinez2026independent,
  title = {{Independent domination in central graphs}},
  author = {Abel Cabrera-Martínez and José Luis López-Carmona and Ismael Rios-Villamar and Alejandro Serrano-Díaz},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.16357},
  eprint = {2609.16357},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.16357},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Independent domination in central graphs
AU  - Abel Cabrera-Martínez
AU  - José Luis López-Carmona
AU  - Ismael Rios-Villamar
AU  - Alejandro Serrano-Díaz
PY  - 2026
DA  - 2026/09/14
PB  - arXiv
DO  - 10.48550/arxiv.2609.16357
UR  - https://arxiv.org/abs/2609.16357
AB  - Let G be a graph with vertex set V(G). A set I⊆ V(G) is an independent dominating set of G if no two vertices in I are adjacent and every vertex in V(G)∖ I is adjacent to at least one vertex in I. The independent domination number of G is the minimum cardinality among all independent dominating sets of G. The aim of this article is to obtain tight bounds and closed formulas for the independent domination number of central graphs. The results are expressed in terms of parameters of the original graph from which the central graph is constructed.
ER  -