The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

The domination number of graph is the smallest cardinality set G. A subset a vertex S G called if every element dominates G, meaning that not an connected and one distance from S. has become interesting research studies on several graphs k -connected such as circulant graphs, grids, wheels. This study aims to determine other k-connected Harary graph. method used pattern detection axiomatic dedu...

A direct, constructive proof is given for the basic representation theorem for convex domination of measures. The proof is given in the finitistic case Žpurely . atomic measures with a finite number of atoms , and a simple argument is then given to extend this result to the general case, including both probability measures and finite Borel measures on infinite-dimensional spaces. The infinite-d...