z-logo
open-access-imgOpen Access
Spanning trees with disjoint 2 dominating and 2-dominating sets
Author(s) -
Mateusz Miotk,
Paweł Żyliński
Publication year - 2019
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2258
Subject(s) - mathematics , combinatorics , dominating set , disjoint sets , spanning tree , discrete mathematics , graph , vertex (graph theory)
In this paper, we provide a structural characterization of graphs having a spanning tree with disjoint dominating and 2-dominating sets.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom