Articles producció científica> Enginyeria Informàtica i Matemàtiques

On the super domination number of graphs

  • Identification data

    Identifier: imarina:9138942
    Authors:
    Klein, Douglas JRodriguez-Velazquez, Juan AYi, Eunjeong
    Abstract:
    © 2020 Azarbaijan Shahid Madani University The open neighborhood of a vertex v of a graph G is the set N(v) consisting of all vertices adjacent to v in G. For D ⊆ V (G), we define D = V (G) \ D. A set D ⊆ V (G) is called a super dominating set of G if for every vertex u ∈ D, there exists v ∈ D such that N(v) ∩ D = {u}. The super domination number of G is the minimum cardinality among all super dominating sets of G. In this paper, we obtain closed formulas and tight bounds for the super domination number of G in terms of several invariants of G. We also obtain results on the super domination number of corona product graphs and Cartesian product graphs.
  • Others:

    Author, as appears in the article.: Klein, Douglas J; Rodriguez-Velazquez, Juan A; Yi, Eunjeong
    Department: Enginyeria Informàtica i Matemàtiques
    URV's Author/s: Rodríguez Velázquez, Juan Alberto
    Keywords: Super domination number Domination number Corona product Cartesian product
    Abstract: © 2020 Azarbaijan Shahid Madani University The open neighborhood of a vertex v of a graph G is the set N(v) consisting of all vertices adjacent to v in G. For D ⊆ V (G), we define D = V (G) \ D. A set D ⊆ V (G) is called a super dominating set of G if for every vertex u ∈ D, there exists v ∈ D such that N(v) ∩ D = {u}. The super domination number of G is the minimum cardinality among all super dominating sets of G. In this paper, we obtain closed formulas and tight bounds for the super domination number of G in terms of several invariants of G. We also obtain results on the super domination number of corona product graphs and Cartesian product graphs.
    Thematic Areas: Mathematics, applied Mathematics Discrete mathematics and combinatorics Control and optimization
    licence for use: https://creativecommons.org/licenses/by/3.0/es/
    Author's mail: juanalberto.rodriguez@urv.cat
    Author identifier: 0000-0002-9082-7647
    Record's date: 2024-10-26
    Papper version: info:eu-repo/semantics/publishedVersion
    Link to the original source: http://comb-opt.azaruniv.ac.ir/article_13980.html
    Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
    Papper original source: Communications In Combinatorics And Optimization. 5 (2): 83-96
    APA: Klein, Douglas J; Rodriguez-Velazquez, Juan A; Yi, Eunjeong (2020). On the super domination number of graphs. Communications In Combinatorics And Optimization, 5(2), 83-96. DOI: 10.22049/CCO.2019.26587.1122
    Article's DOI: 10.22049/CCO.2019.26587.1122
    Entity: Universitat Rovira i Virgili
    Journal publication year: 2020
    Publication Type: Journal Publications
  • Keywords:

    Control and Optimization,Discrete Mathematics and Combinatorics,Mathematics,Mathematics, Applied
    Super domination number
    Domination number
    Corona product
    Cartesian product
    Mathematics, applied
    Mathematics
    Discrete mathematics and combinatorics
    Control and optimization
  • Documents:

  • Cerca a google

    Search to google scholar