All Stories

  1. Restrained domination in self-complementary graphs
  2. Minimal graphs with disjoint dominating and paired-dominating sets
  3. Total forcing sets and zero forcing sets in trees
  4. Equating k maximum degrees in graphs without short cycles
  5. Matching, path covers, and total forcing sets
  6. Graphs with large semipared domination number
  7. On accurate domination in graphs
  8. On independent domination in planar, cubic graphs
  9. Tight lower bounds on the matching number in a graph with given maximum degree
  10. Domination parameters of a graph and its complement
  11. Hereditary equality of domination and exponential domination
  12. Total domination versus paired-domination in regular graphs
  13. Thoroughly dispersed colorings
  14. Packing in regular graphs
  15. The forcing number of graphs with given girth
  16. Smallest domination number and largest independence number of graphs and forests with given degree sequence
  17. Domination game: extremal families for 3/5-conjecture for forests
  18. Vertices contained in all or in no minimum semitotal dominating set of a tree
  19. Bounds on the disjunctive total domination number of a tree
  20. A characterization of hypergraphs with large domination number
  21. A note on non-dominating set partitions in graphs
  22. On 2-Colorings of Hypergraphs