Domination and irredundance in cubic graphs
- 15 April 1997
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 167-168, 205-214
- https://doi.org/10.1016/s0012-365x(96)00229-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Inequalities relating domination parameters in cubic graphsDiscrete Mathematics, 1996
- A note on graphs which have upper irredundance equal to independenceDiscrete Applied Mathematics, 1993
- What is the difference between the domination and independent domination numbers of a cubic graph?Graphs and Combinatorics, 1991
- Chordal graphs and upper irredundance, upper domination and independenceDiscrete Mathematics, 1990
- Two relations between the parameters of independence and irredundanceDiscrete Mathematics, 1988
- Stability, domination and irredundance in a graphJournal of Graph Theory, 1986
- Contributions to the theory of domination, independence and irredundance in graphsDiscrete Mathematics, 1981
- Graph‐theoretic parameters concerning domination, independence, and irredundanceJournal of Graph Theory, 1979
- Properties of Hereditary Hypergraphs and Middle GraphsCanadian Mathematical Bulletin, 1978
- On domination and independent domination numbers of a graphDiscrete Mathematics, 1978