TY - CHAP

T1 - Domination in fuzzy graphs

AU - Mordeson, John N.

AU - Mathew, Sunil

AU - Malik, Davender S.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - The results of the next two sections are based on Somasundaram, Somasundaram (Pattern Recongit Lett 19:787–791, 1998), [29]. The formal mathematical definition of domination was given by Ore, (Theory of graphs. American Mathematical Society, Providence, 1962), [22]. Cockayne and Hedetnieme, (Networks 7:247–261, 1977, [3]), published a survey paper on this topic in 1977 and since then hundreds of papers have been published on this subject. According to Somasundaram, Somasundaram (Pattern Recongit Lett 19:787–791, 1998, [29]), the rapid growth of research in this area is due to the following three factors. (1) The diversity of applications of domination theory to both real world and mathematical coverings or location problems. (2) The wide variety of domination parameters that can be defined. (3) The NP-completeness of the basic domination problem, its close and natural relationship to other NP-complete problems and the subsequent interest in finding polynomial time solutions to domination problems in special classes of graphs.

AB - The results of the next two sections are based on Somasundaram, Somasundaram (Pattern Recongit Lett 19:787–791, 1998), [29]. The formal mathematical definition of domination was given by Ore, (Theory of graphs. American Mathematical Society, Providence, 1962), [22]. Cockayne and Hedetnieme, (Networks 7:247–261, 1977, [3]), published a survey paper on this topic in 1977 and since then hundreds of papers have been published on this subject. According to Somasundaram, Somasundaram (Pattern Recongit Lett 19:787–791, 1998, [29]), the rapid growth of research in this area is due to the following three factors. (1) The diversity of applications of domination theory to both real world and mathematical coverings or location problems. (2) The wide variety of domination parameters that can be defined. (3) The NP-completeness of the basic domination problem, its close and natural relationship to other NP-complete problems and the subsequent interest in finding polynomial time solutions to domination problems in special classes of graphs.

UR - http://www.scopus.com/inward/record.url?scp=85044177982&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85044177982&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-76454-2_2

DO - 10.1007/978-3-319-76454-2_2

M3 - Chapter

AN - SCOPUS:85044177982

T3 - Studies in Fuzziness and Soft Computing

SP - 57

EP - 85

BT - Studies in Fuzziness and Soft Computing

PB - Springer Verlag

ER -