Locating-total domination in grid graphs
From MaRDI portal
Publication:2305616
DOI10.1007/s40840-019-00733-9zbMath1434.05109OpenAlexW2914864918MaRDI QIDQ2305616
Publication date: 11 March 2020
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-019-00733-9
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locating-total domination in graphs
- Bounds on locating total domination number of the Cartesian product of cycles and paths
- Bounds on the locating-total domination number of a tree
- Bounding the locating-total domination number of a tree in terms of its annihilation number
- A note on the locating-total domination in graphs
- Locating and total dominating sets in trees
- A characterization of locating-total domination edge critical graphs
- On locating and differetiating-total domination in trees