Domination ratio of a family of integer distance digraphs with arbitrary degree
Author:
- 6 May 2022
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 317, 1-9
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- On the independence ratio of distance graphsDiscrete Mathematics, 2016
- Subgroups as efficient dominating sets in Cayley graphsDiscrete Applied Mathematics, 2013
- Efficient domination in circulant graphsDiscrete Mathematics, 2013
- The bondage numbers and efficient dominations of vertex-transitive graphsDiscrete Mathematics, 2008
- Efficient domination in circulant graphs with two chord lengthsInformation Processing Letters, 2007
- Efficient dominating sets in Cayley graphsDiscrete Applied Mathematics, 2003
- Tiling the Integers with Translates of One Finite SetJournal of Algebra, 1999
- Sets of integers with missing differencesJournal of Combinatorial Theory, Series A, 1977
- Tesselation of integersJournal of Number Theory, 1977
- Sequences of integers with missing differencesJournal of Combinatorial Theory, Series A, 1973