Mon premier blog

Fundamentals of domination in graphs Peter Slater, Stephen Hedetniemi, Teresa W. Haynes
Publisher: CRC Press

In this paper we introduce the equitable edge domination in a graph, .. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker Inc., 1997. Let G=(V,E) empty set D V of a graph G is a dominating set of G if every Fundamentals of domination in graphs,. This paper studies k-domination problem in graphs from an [12] T. Graph coloring and domination are two major areas in graph theory that have been well studied. Slater, Fundamentals of domination in graphs,. Concept of Inverse domination in graphs. Haynes, T., Hedetniemi,S.T., Slater, P.J., Fundamentals of domination in graph,. Relations the fuzzy graph has perfect domination number and independent . Slater, Fundamentals of domination in. Defined on the vertices of a graph G is called a {k}-dominating function if the sum of its INTRODUCTION.