Tightness of domination inequalities for direct product graphs
From MaRDI portal
Publication:2037578
DOI10.1016/j.disc.2021.112495zbMath1473.05219arXiv2008.03887OpenAlexW3172564509MaRDI QIDQ2037578
Publication date: 8 July 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.03887
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Binary programming formulations for the upper domination problem ⋮ Unimodality and monotonic portions of certain domination polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for the domination number and the total domination number of direct product graphs
- Dominating direct products of graphs
- Relations between packing and covering numbers of a tree
- Domination and upper domination of direct product graphs
- Isoperimetry, stability, and irredundance in direct products
- Domination in direct products of complete graphs
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
- Associative graph products and their independence, domination and coloring numbers
- Vizing's conjecture: a survey and recent results
- Paired-domination in graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
This page was built for publication: Tightness of domination inequalities for direct product graphs