We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Mathematics

Search Results

Showing 1-17 of 17 results

  1. A Characterization of Graphs with Semitotal Domination Number One-Third Their Order

    In an isolate-free graph G , a subset S of vertices is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within...

    Jie Chen, Cai-**a Wang, ... Shou-Jun Xu in Graphs and Combinatorics
    Article 30 May 2024

  2. On the Semitotal Forcing Number of a Graph

    Zero forcing is an iterative graph coloring process that starts with a subset S of “colored" vertices, all other vertices being “uncolored". At each...

    Qin Chen in Bulletin of the Malaysian Mathematical Sciences Society
    Article 15 January 2022

  4. Trees with Unique Minimum Semitotal Dominating Sets

    A set S of vertices in a graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of...

    Teresa W. Haynes, Michael A. Henning in Graphs and Combinatorics
    Article 14 February 2020

  5. From the Strong Differential to Italian Domination in Graphs

    A. Cabrera Martínez, J. A. Rodríguez-Velázquez in Mediterranean Journal of Mathematics
    Article Open access 14 September 2021

  8. Perfect graphs involving semitotal and semipaired domination

    Let G be a graph with vertex set V and no isolated vertices, and let S be a dominating set of V . The set S is a semitotal dominating set of G if...

    Teresa W. Haynes, Michael A. Henning in Journal of Combinatorial Optimization
    Article 11 May 2018

  9. Models of Domination in Graphs

    A set S of vertices in a graph G is a dominating set if every vertex not in S is adjacent to at least one vertex in S. In this chapter, we present...
    Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning in Topics in Domination in Graphs
    Chapter 2020

  10. Semipaired domination in maximal outerplanar graphs

    Michael A. Henning, Pawaton Kaemawichanurat in Journal of Combinatorial Optimization
    Article 08 June 2019

  12. Semitotal Domination in Claw-Free Cubic Graphs

    The semitotal domination number of a graph G without isolated vertices is the minimum cardinality of a set S of vertices of G such that every vertex...

    Enqiang Zhu, Zehui Shao, ** Xu in Graphs and Combinatorics
    Article 28 June 2017

  13. Edge Weighting Functions on Semitotal Dominating Sets

    A set S of vertices in an isolate-free graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within...

    Michael A. Henning in Graphs and Combinatorics
    Article 08 February 2017

  14. Semipaired Domination in Claw-Free Cubic Graphs

    Michael A. Henning, Pawaton Kaemawichanurat in Graphs and Combinatorics
    Article 21 June 2018

  15. Semitotal Domination in Claw-Free Cubic Graphs

    Michael A. Henning, Alister J. Marcon in Annals of Combinatorics
    Article 12 October 2016

  16. Linear MIM-Width of Trees

    We provide an \(O(n \log n)\) algorithm computing the...
    Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset in Graph-Theoretic Concepts in Computer Science
    Conference paper 2019

  17. An Annotated Glossary of Graph Theory Parameters, with Conjectures

    This glossary contains an annotated listing of some 300 parameters of graphs, together with their definitions, and, for most of these, a reference to...
    Ralucca Gera, Teresa W. Haynes, ... Michael A. Henning in Graph Theory
    Chapter 2018
Did you find what you were looking for? Share feedback.