On -domination and -independence in graphs
Authors:
- Adriana HansbergAHAdriana Hansberg
- Ryan PepperRPRyan Pepper
- 1 July 2013
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 161 (10-11) , 1472-1480
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education and Science, Spain
- European Regional Development Fund (ERDF)
This publication has 12 references indexed in Scilit:
- Bounds on the -domination number of a graphApplied Mathematics Letters, 2011
- k-Domination and k-Independence in Graphs: A SurveyGraphs and Combinatorics, 2011
- Independence andk-domination in graphsInternational Journal of Computer Mathematics, 2011
- On graphs with equal domination and 2-domination numbersDiscrete Mathematics, 2008
- On k‐domination and minimum degree in graphsJournal of Graph Theory, 2007
- Independent sets in triangle-free cubic planar graphsJournal of Combinatorial Theory, Series B, 2006
- An upper bound for the k‐domination number of a graphJournal of Graph Theory, 1985
- On a conjecture of Fink and Jacobson concerning k-domination and k-dependenceJournal of Combinatorial Theory, Series B, 1985
- Some Ramsey-type numbers and the independence ratioTransactions of the American Mathematical Society, 1979
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941