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. Heredity for general ...
Article

Heredity for generalized power domination

Paul Dorbec ORCID (1), Seethu Varghese (2), Ambat Vijayakumar (2)
(1) Laboratoire Bordelais de Recherche en Informatique
(2) Cochin University of Science and Technology
Download article
Open on HAL
Submitted on
March 31, 2016
Published on
April 3, 2016
Last modified on
March 31, 2025
Volume 18
vol. 18:3
Graph Theory
DOI
10.46298/dmtcs.1290
License
https://about.hal.science/hal-authorisation-v1
Indicators
1287
Views
1575
Downloads

Heredity for generalized power domination

Paul Dorbec ORCID (1), Seethu Varghese (2), Ambat Vijayakumar (2)
(1) Laboratoire Bordelais de Recherche en Informatique
(2) Cochin University of Science and Technology
Abstract
In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction. We prove optimal bounds for $\gamma_{p,k}(G-e)$, $\gamma_{p,k}(G/e)$ and for $\gamma_{p,k}(G-v)$ in terms of $\gamma_{p,k}(G)$, and give examples for which these bounds are tight. We characterize all graphs for which $\gamma_{p,k}(G-e) = \gamma_{p,k}(G)+1$ for any edge $e$. We also consider the behaviour of the propagation radius of graphs by similar modifications.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • power domination
  • heredity
  • vertex deletion
  • edge deletion
  • edge contraction
  • propagation radius
Cited by

Source: OpenCitations

  • Power Domination in Graphs

    Authors : Paul Dorbec ORCID

    Journal reference : Volume , 2020, pp. 521-545

    DOI : 10.1007/978-3-030-51117-3_16
  • Power contamination and domination on the grid

    Mathematica Montisnigri

    Authors : Amina Ainouche ORCID, Sadek Bouroubi ORCID

    Journal reference : Volume 50, 2021, pp. 27-35

    DOI : 10.20948/mathmontis-2021-50-3
  • Power domination on triangular grids with triangular and hexagonal shape

    Journal of Combinatorial Optimization

    Authors : Prosenjit Bose ORCID, Valentin Gledel ORCID, Claire Pennarun ORCID, Sander Verdonschot ORCID

    Journal reference : Volume 40, 2020, pp. 482-500

    DOI : 10.1007/s10878-020-00587-z
Preview
Loading PDF preview...