Thirusangu, K.

• Graceful and Skolem Graceful Labeling in Extended Duplicate Graph of Path

Abstract Views :400  |  PDF Views:124

Authors

P. P. Ulaganathan ¹, K. Thirusangu ¹, B. Selvam ¹

Affiliations
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai–600 073, IN

Source

Indian Journal of Science and Technology, Vol 4, No 2 (2011), Pagination: 107-111

Abstract

In this paper, we prove that the Extended Duplicate Graph of Path is Graceful and Skolem-graceful. AMS subject classification: 05C78

Keywords

Graph Labeling, Graceful Labeling, Skolem-graceful Labeling, Extended Duplicate Graph

Full Text

   

References

• Gallian JA (2010) A dynamic survey of graph labeling. Elec. J. Combin. 17, # DS6.
• Golomb SW (1997) How to number a graph, in graph theory and computing, RC Read, ed., Academic press, NY. pp:23-37.
• Lee SM, Wang S and Wui I (1988) On Skolemgracefulness of 4 stars. Congr. Number. 62, 235-239.
• Rosa A (1967) On certain valuations of the vertices of a graph, theory of graphs (Int. Symp. Rome, July 1966), Gordon and Breech NY and Dunod paris.pp:349-355.
• Thirusangu K, Ulaganathan PP and Selvam B (2010) Cordial labeling in duplicate graphs. Int. J. Computer Math. Sci. Appl. 4(1-2), 179-186.
• Youssef MZ (2003) New families of graceful graphs. Ars. Combin. 67, 303-311

• (a,d)-antimagic Labelings in Extended Duplicate Twig Graphs

Abstract Views :430  |  PDF Views:113

Authors

B. Selvam ¹, K. Thirusangu ¹, P. P. Ulaganathan ¹

Affiliations
1 Department of Mathematics, S. I. V. E. T. College, Gowrivakkam, Chennai–600073, IN

Source

Indian Journal of Science and Technology, Vol 4, No 2 (2011), Pagination: 112-115

Abstract

In this paper, we show that the class of Extended Duplicate Graphs of a Twig is (a,d)-edge-antimagic vertex labeling. AMS subject classification: 05C78

Keywords

Graph Labeling, Duplicate Graphs, Twigs, (a,d)-edge-antimagic Vertex Labeling

Full Text

   

References

• Bodendick R and Walter G (1997) (a,d)-antimagic parachutes I I. Ars Combin. 46, 33-63.
• Gallian JA (2010) A dynamic survey of graph labeling. Elec. J Combinatories. 17, #D S6.
• Hartsfield N and Ringel G (1990) Pearls in graph theory, academic press, Boston-San Diego, New York-London.
• Nicholas T, Somasundaram S and Vilfred V (2004) On (a,d)-antimagic special trees, unicyclic graphs and complete bipartite graphs. Ars Combin. 70, 207-220.
• Rosa A (1966) On certain valuations of the vertices of a graph. Int. Symp. Rome, July 1966, Gordon & Breach NY at Dunod Paris, pp349-355.
• Thirusangu K, Selvam B and Ulaganathan PP (2010) Cordial labeling in Extended Duplicate Twig Graphs. Int. J. Computer, Mathematical Sci. Appl. 4(3-4), 319-328.
• Yegnanarayanan V (2001) On magic graphs. Util. Math. 59, 181-204

• IFAM Model Approach on the Impact of Pesticides on Agricultural Labourers

Abstract Views :387  |  PDF Views:93

Authors

K. Balasangu ¹, K. Thirusangu ², V. R. Dare ³

Affiliations
1 Department of Mathematics, T. K. G. Arts College, Vriddhachalam, TN,, IN
2 Department of Mathematics, SIVET College, Gowrivakkam, Chennai-600073, IN
3 Department of Mathematics, Madras Christian College, Tambaram, Chennai-600059, IN

Source

Indian Journal of Science and Technology, Vol 4, No 2 (2011), Pagination: 151-154

Abstract

We use fuzzy associative memories (FAM) and induced fuzzy associative memories (IFAM), to analyze the causes for health hazards faced by agriculture labourers. Based on our study, we made conclusions and suggested some remedial measures.

Keywords

Health Hazards, FAM, IFAM, Fixed Point, Limit Cycle, Hidden Pattern

Full Text

   

References

• Axelrod R (1976) Structure of decision: The cognitive maps of political elites, Princeton University press, New Jersey.
• Balasangu K, Thirusangu K and Dare VR (2010) IFCM model approach on the health hazards faced by the agriculture labourers. Int. J. Analyzing Methods Components Combinatorial Biol. Maths. (IJAMCCBM) (To appear).
• Balasangu K, Thirusangu K and Rajkumar Dare V (2007) A fuzzy approach on the analysis of health hazards faced by the agriculture labourers due to chemical pollutions, Proc. Of the Indian conf. on intelligent systems (Allied publishers), pp:123-128.
• Kosko B (1986) Fuzzy cognitive maps. Int. J. Man- Machine Studies. 34, 65-75.
• Kosko B (2001) Neural networks and fuzzy systems: A dynamical systems approach to machine intelligence. Prentice Hall publishers.
• Pathinathan T, Thirusangu K and Mary John (2005) On causes for school dropouts- A fuzzy approach. Acta Ciencia Indica, 31(4), 1279-1299
• Thirusangu K, Balasangu K and Dare VR (2008) On the causes of health hazards faced by the agriculture labourers using IBAM model. Int. J. Analyzing Methods Components Combinatorial Biol. Maths (IJAMCCBM), 1(2), 145-153.
• Thirusangu K, Balasangu K and Dare VR (2009a) On the health hazards of the rice cultivators using IFRM model. Int. J. Analyzing Methods of Components Combinatorial Biol. Maths (IJAMCCBM), 1(1), 1-10.
• Thirusangu K, Balasangu K and Dare VR (2009b) A neural network model approach on the health hazards of agriculture farmers. Int. J. Analyzing MethodsComponents Combinatorial Biol. Maths (IJAMCCBM), 1(1), 11-18.
• Zadeh LA (1965) Fuzzy sets. Information Control. 8, 338-353.

• On Bi-magic Labeling of 4-regular Graphs

Abstract Views :436  |  PDF Views:115

Authors

E. Bala ¹, K. Thirusangu ¹

Affiliations
1 Department of mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai-600073, IN

Source

Indian Journal of Science and Technology, Vol 4, No 4 (2011), Pagination: 414-416

Abstract

In this paper we present an algorithm and show that for any finite j, where j ≥ 3 and 2j - 1 ≤ n, there exists a (n, 2n) 4- regular bimagic graph of girth j with magic constants 4n - (j-2) and 5n - (j-2).

Keywords

Graph Labeling, K-regular Graph, Girth

Full Text

   

References

• Baca M, Lin Y, Miller M and Simanjuntak R (2001) New constructions of magic and antimagic graph labeling. Utilitas Mathematica. 60, 229-239.
• Baskar Babujee J (2004) Bimagic Labelling on Path Graphs. J. Math. Edu.38(1),12-16.
• Gallian JA (2009) A dynamic surevey of graph labeling. Elec. J. Combinatorics. 16, DS6.
• Hartsfield N and Ringel G (1990) Pearls in graph theory, Academic press, San Diego.
• Rosa A (1967) On certain valuations of the vertices of a graph, Theory of graphs, Int. Symp., Rome, July 1996, Gordon and Breach NY and Dunod Paris (1967).pp:349-355.
• Thirusangu K, Baskar Babujee J and Rajeswari R (2009) On antimagic labelings in Cayley’s digraphs. Int. J. Mathematics Appl. 2(1-2), 11-16.

• Felicitous Labeling in Extended Duplicate Graph of Twig T_m

Abstract Views :482  |  PDF Views:101

Authors

B. Selvam ¹, K. Thirusangu ¹, P. P. Ulaganathan ¹

Affiliations
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai – 600 073, IN

Source

Indian Journal of Science and Technology, Vol 4, No 5 (2011), Pagination: 586-589

Abstract

In this paper, we show that the class of Extended Duplicate Graph of a Twig is Felicitious.

Keywords

Graph Labeling, Graceful Labeling, Felicitious Labeling, Duplicate Graphs, Twigs

Full Text

   

References

• Balakrishnan R and Kumar R (1994) Existence and nonexistence of certain labellings for the graph Kc 2K2. Util. Math. 46 97-102.
• Balakrishnan R, Selvam A and Yegnanarayanan V (1996) On felicitious labelings of graphs. Proc. Natl. Workshop on Graph Theory and Its Appl. Manonmaniam Sundaranar Univ., Tiruneli. pp: 47-61.
• Gallian JA (2010) A Dynamic survey of graph labeling. The Electr. J. Combinatorics. 17,# DS6.
• Golomb SW (1972) How to number a graph, in Graph theory and computing. Read RC (ed.), Academic Press, NY. pp: 23-37.
• Lee SM, Schmeichel E and Shee SC (1991) On felicitious graphs, Discrete Math. 93, 201-209.
• Rosa A (1966) On certain valuations of the vertices of a graph. Intl. Symp., Rome, Gordon & Breach, N.Y. at Dunod Paris. pp: 349-355.
• Selvam B, Thirusangu K and Ulaganathan PP (2011) Graceful and Skolem graceful labelings in Extended Duplicate Twig graphs. Intl. J. Combinatorics Graph Theory & Applications. (Accepted for Publications).
• Thirusangu K, Selvam B and Ulaganathan PP (2010) Cordial Labeling in Extended Duplicate Twig graphs. Intl. J. Computer, Math. Sci. & Applications. 4 (3-4), 319-328.
• Yegnanarayanan V (1999) On some additive analogues of graceful theme: cycle-related graphs. Southeast Asian Bull. Math. 23, 317–333.

• Super Edge-magic Total Labeling in Extended Duplicate Graph of Path

Abstract Views :353  |  PDF Views:121

Authors

P. P. Ulaganathan ¹, K. Thirusangu ¹, B. Selvam ¹

Affiliations
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai-600 073, IN

Source

Indian Journal of Science and Technology, Vol 4, No 5 (2011), Pagination: 590-592

Abstract

In this paper, we prove that the Extended Duplicate Graph of a path is super edge-magic.

Keywords

Graph Labeling, Super Edge-magic Total Labeling, Extended Duplicate Graphs

Full Text

   

References

• Enomoto H, Llado AS, Nakamigawa T and Ringel G (1998) Super edge-magic. SUT. J. Math. 34, 105-109.
• Figueroa-Centeno R, Ichishima R and Muntaner-Batle F (2001) The place of super edge-magic labelings among other classes of labeling. Discrete Math. 231, 153-168.
• Gallian JA (2010) A dynamic survey of graph labeling. The Electronic J. Combinatories. 17, # DS6.
• Kotzig A and Rosa A (1970) Magic valuations of finite graphs. Canad. Math. Bull. 13, 451-461.
• Rosa A (1967) On certain valuations of the vertices of a graph. Theory of Graphs. Intl. Sym. Rome, July 1966, Gordon & Breech, N.Y. and Dunod Paris. pp: 349-355.
• Thirusangu K, Ulaganathan PP and Selvam B (2010) Cordial labeling in duplicate graphs. Intl. J. Computer. Math. Sci. & Appl. 4 (1-2), 179-186.
• Wallis WD (2001) Magic Graphs. Birkhäuser, Boston.

• A Fuzzy Bimodel Approach on the Exposures to the Health Hazards of Agriculture Labourers

Abstract Views :473  |  PDF Views:128

Authors

K. Balasangu ¹, K. Thirusangu ², V. R. Dare ³

Affiliations
1 Department of Mathematics, T.K.G. Arts College, Vridhachalam, Tamilnadu, IN
2 Department of Mathematics, SIVET College, Gowrivakkam, Chennai-600073, IN
3 Department of Mathematics, Madras Christian College, Tambaram, Chennai-600059, IN

Source

Indian Journal of Science and Technology, Vol 4, No 9 (2011), Pagination: 1074-1080

Abstract

In this paper, we introduce a new Fuzzy bimodel called Induced Fuzzy Cognitive Relational Maps (IFCRM). Using this new bimodel, we analyze the problem of health hazards faced by the agricultural labourers due to chemical pollutions. Based on our study, we made conclusions and suggest some remedial measures.

Keywords

Health Hazards, FCM, FRM, FCRM, IFCRM, Fixed Point, Limit Cycle, Hidden Pattern

Full Text

   

References

• Balasangu K, Thirusangu K and Rajkumar Dare V (2007) A fuzzy approach on the analysis of health hazards faced by the agriculture labourers due to chemical pollutions, Proc. of the Indian Conf. on Intelligent Systems. Allied Publ. 123-128.
• Balasangu K, Thirusangu K and Rajkumar Dare V (2009) On the health hazards of the rice cultivators using IFRM model. Intl. J. Analyzing Methods of Components & Combinatorial Biol. in Mathematics (IJAMCCBM), 1(1), 1-10.
• Balasangu K, Thirusangu K and Rajkumar Dare V (2011) IFAM model approach on the impact of pesticides on agricultural labourers. Indian J. Sci. Technol. 4(2), 151-154.
• Klir GJ and Folger TA (1998) Fuzzy sets, uncertainty, and information. Prentice Hall, New Jersey.
• Kosko B (1988) Bidirectional associative memories. IEEE Transact. on Systems, Man & Cybernetics. SMC- 18, 49-60.
• Kosko B ( 2001) Neural networks and fuzzy systems. Prentice Hall, India.
• Pathinathan T, Thirusangu K and Mary John (2005) On causes for school dropouts- A fuzzy approach. Acta Ciencia Indica. XXXI M, (4)1279-1299.
• Praveen Prakash A (2010) Analysis of the problems faced by the rural disadvantaged persons with disabilities– using new fuzzy bimodels. Ph.D. Thesis, University of Madras.
• Zadeh LA (1965) Fuzzy sets. Information Control. 8, 338-353.

• A New Bidirectional Associative Fuzzy Cognitive Dynamical System

Abstract Views :423  |  PDF Views:97

Authors

K. Thirusangu ¹, P. Elumalai ², A. Praveenprakash ³

Affiliations
1 Department of Mathematics, SIVET College, Gowrivakkam, Chennai 600 073, IN
2 Department of Mathematics, Government Arts College, Thiruvannamalai-606603, Tamil Nadu, IN
3 Department of Mathematics, Hindustan University, Chennai 603 103, IN

Source

Indian Journal of Science and Technology, Vol 5, No 3 (2012), Pagination: 2333-2340

Abstract

In this paper, we introduce a new Fuzzy bimodel called Bidirectional Associative Fuzzy Cognitive Maps (BAFCM). We state the advantages of this system and its application in addressing to socio-economic problems.

Keywords

FCM, BAM, BAFCM, Fixed Point, Limit Cycle, Bihidden Pattern

Full Text

   

References

• Balasangu K, Thirusangu K and Rajkumar Dare V (2007) A fuzzy approach on the analysis of health hazards faced by the agriculture labourers due to chemical pollutions. Proc. Indian Conf. on Intelligent Systems, Allied Publ.. pp: 123-128.
• Balasangu K, Thirusangu K and Rajkumar Dare V (2009) On the health hazards of the rice cultivators using IFRM model. IJAMCCBM. 1 (1), 1-10.
• Balasangu K, Thirusangu K and Rajkumar Dare V (2011) IFAM model approach on the impact of pesticides on agricultural labourers. Indian J.Sci.Technol. 4 (2), 151-154.
• Klir GJ and Folger TA (1998) Fuzzy sets, uncertainty, and information. Prentice Hall, New Jersey.
• Kosko B (1988) Bidirectional associative memories. IEEE Transact. Systems, Man & Cybernetics, SMC- 18, 49-60.
• Kosko B (2001) Neural networks and fuzzy systems. Prentice Hall, India.
• Pathinathan T, Thirusangu K and Mary John (2005) On causes for school dropouts- A fuzzy approach. Acta Ciencia Indica, XXXI M, (4) 1279-1299.
• Praveen Prakash A (2010) Analysis of the problems faced by the rural disadvantaged persons with disabilities – Using new fuzzy bimodels, Ph.D., Thesis, University of Madras.
• Zadeh LA (1965) Fuzzy sets. Information Control. (8) 338-353.

• Parametrical Analysis of Friction Stir Welding of Dissimilar Aluminum AA7075 and AA2024 Using Graph Labeling

Abstract Views :495  |  PDF Views:112

Authors

J. Jayapriya ¹, D. Muruganandam ¹, K. Thirusangu ², Sushil Lal Das ³

Affiliations
1 Research Scholar, Sathyabama University, Chennai119
2 Department of Mathematics, S.I.V.E.T College, Chennai–73
3 Department of Mechanical Engineering, Jeppiaar Engineering College, Chennai–119

Source

Indian Journal of Science and Technology, Vol 5, No 8 (2012), Pagination: 3223-3226

Abstract

In this paper the numerical data involved during the processes of welding is stored over a graph structure and its changes during compression are analyzed by using max/mini edge labeling.

Keywords

Graph, Function, Labeling, Alloy, Welding, Max/mini Labeling

Full Text

   

References

• Gallian JA (2011) A dynamic survey of graph labeling. The Electronic J. of Combinatoric. 18, DS6.

• Graph Labeling in Competition Graph

Abstract Views :501  |  PDF Views:97

Authors

E. Bala ¹, K. Thirusangu ¹

Affiliations
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai–600073, IN

Source

Indian Journal of Science and Technology, Vol 4, No 8 (2011), Pagination: 938-943

Abstract

In this paper we present an algorithm and prove the existence of graph labelings such as Z₃- magic, E-cordial, total Ecordial, Product cordial, total product cordial, Product E-cordial, total product E-cordial labelings for the competition graph of the Cayley digraphs associated with Z_n.

Keywords

Cayley Digraphs, Graph Labeling, A-Magic

Full Text

   

References

• Andar M, Boxwala S and Limaye N (2005) On the cordiality of the t-ply Pt(u,v). Ars. Combin. 77, 245- 259.
• Annexstein F, Baumslag M and Rosenberg AL (1990) Group action graphs and parallel architectures. SIAM J. Comput.19, 544-569.
• Bala E and Thirusangu K (2011) Some graph labelings in competition graph of Cayley digraphs. Intl. J. Combinatorial Graph Theory & Appl. (in press).
• Cahit J (1987) Cordial graphs; a weaker version of graceful and harmonious graphs. Ars. Combin. 23, 201-207.
• Cahit J (1990) On Cordial and 3-equitable labelings of graphs. Util. Math. 37, 189-198.
• Gallian JA (2009) A dynamic survey of graph labeling. The Electronic J. Combinatrics. 16, DS6.
• Heydemann M (1997) Cayley graphs and interconnection networks. In: Graph symmetry: Algebraic methods and Applications. Hahn G & Sabidussi G (Eds). pp: 167-224.
• Rosa A (1967) On certain valuations of the vertices of a graph. In: Theory of graphs. Intl. Symp., Rome, (July 1996), Gordon and Breach, N.Y. and Dunod Paris. pp: 349-355.
• Thirusangu K, Baskar Babujee J and Rajeswari R (2009) On antimagic labelings in Cayley’s Digraphs. Intl. J. Math. Appl. 2(1-2), 11-16.
• Thirusangu K, Atulya K. Nagar and Rajeswari R (2011) Labelings in Cayley’s Digraphs. Eur. J. Combinatrics. 32, 133-139.
• Yilmaz R and Cahit I (1997) E-cordial graphs. Ars. Combin. 46, 251-266.
• Youssef MZ (2006) On Skolem-graceful and cordial graphs. Ars. Combin. 78, 167-177.

• Mean Labeling in Extended Duplicate Graph of Twig

Abstract Views :214  |  PDF Views:0

Authors

B. Selvam ¹, K. Thirusangu ¹

Affiliations
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai – 600 07, IN

Source

Indian Journal of Science and Technology, Vol 8, No 36 (2015), Pagination: 

Abstract

In this paper, we prove that the extended duplicate graph of twig is mean labeling.

Keywords

Extended Duplicate Graphs, Graph Labeling, Mean Labeling 1.

Full Text