Dates First available in Project Euclid: Download Email Please enter a valid email address. Livingston, Caterpillars with equal domination and independent domination numbers, in: If , then G is said to be a regular graph of degree r or simply r-regular. Now we are in a position to state the following theorems without proof because it can be easily proved from the theorems given above.
Independent domination in chordal graphs
Domination, independence and irredundance in graphs - DML-PL - Yadda
The open neighbourhood of the vertex v consists of the set of vertices adjacent to v. Well covered simplicial and chordal graphs Well covered generalized Petersen graphs Independent Set and Dominating Set 4. Introduction and preliminary results Then w is adjacent to both u and v.
Trees and forests with large and small independent indices, Chinese J. Towards a theory of domination in graphs. Unable to display preview. Hedetniemi, A note on total domination, Discrete Math. One of its advantages over other graph products is its ability to produce sparse graphs. Proof — The n -dimensional cube or hypercube Q n contains 2 n vertices and is n -regular.