abhirami shanmugasundaram - Academia.edu (original) (raw)
Uploads
Papers by abhirami shanmugasundaram
In this chapter the concepts of intuitionistic fuzzy g# closed set, intuitionistic fuzzy g# conti... more In this chapter the concepts of intuitionistic fuzzy g# closed set, intuitionistic fuzzy g# continuous mapping, strongly intuitionistic fuzzy g# continuous mapping, intuitionistic fuzzy g# irresolute mapping and perfectly intuitionistic fuzzy g# continuous mapping are studied. The concept of intuitionistic fuzzy g# compact is introduced. Some interesting properties are investigated besides giving some examples.
Global Journal of Pure and Applied Mathematics
Let G = (V , E) be a simple graph and f : V → {1, 2, 3 .... |V|} be a bijection. For each edge uv... more Let G = (V , E) be a simple graph and f : V → {1, 2, 3 .... |V|} be a bijection. For each edge uv, assign the label 1 if f (u)+f (v) is even and the label 0 otherwise. f is called an even sum cordial labeling if ��ef (0) − ef (1) � ≤ 1, where ef (1) and ef (0) denote the number of edges labeled with 1 and not labeled with 1 respectively. In this paper,the concepts of even sum cordial labeling deeds of paths, cycle, double fan Pn + 2K1, Jewel graph and Cn − 2 + K2 are introduced.
In this chapter the concepts of intuitionistic fuzzy g# closed set, intuitionistic fuzzy g# conti... more In this chapter the concepts of intuitionistic fuzzy g# closed set, intuitionistic fuzzy g# continuous mapping, strongly intuitionistic fuzzy g# continuous mapping, intuitionistic fuzzy g# irresolute mapping and perfectly intuitionistic fuzzy g# continuous mapping are studied. The concept of intuitionistic fuzzy g# compact is introduced. Some interesting properties are investigated besides giving some examples.
Global Journal of Pure and Applied Mathematics
Let G = (V , E) be a simple graph and f : V → {1, 2, 3 .... |V|} be a bijection. For each edge uv... more Let G = (V , E) be a simple graph and f : V → {1, 2, 3 .... |V|} be a bijection. For each edge uv, assign the label 1 if f (u)+f (v) is even and the label 0 otherwise. f is called an even sum cordial labeling if ��ef (0) − ef (1) � ≤ 1, where ef (1) and ef (0) denote the number of edges labeled with 1 and not labeled with 1 respectively. In this paper,the concepts of even sum cordial labeling deeds of paths, cycle, double fan Pn + 2K1, Jewel graph and Cn − 2 + K2 are introduced.