Magic and Bimagic Labeling for Disconnected Graphs

Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2012, Vol 3, Issue 2

Abstract

 An edge magic total labeling of a graph G V E ( , ) with p vertices and q edges is a bijection f from the set of vertices and edges to 1,2,..., p q  such that for every edge uv in E, f u f uv f v ( ) ( ) ( )   is a constant k. If t here exist two constants 1k and 2k such that the above sum is either 1k or 2 k , it is said to be an edge bimagic total labeling. A total edge magic (edge bimagic) graph is called a super edge magic (super edge bimagic) if f V G p ( ( )) {1,2,..., }  . A total edge magic (edge bimagic) graph is called a superior edge magic (superior edge bimagic) if f E G ( ( )) {1,2,..., q}  .In this paper we give magic and bimagic labelings for some class of disconnected graphs

Authors and Affiliations

S. Babitha # , A. Amarajothi* , J. Baskar Babujee

Keywords

Related Articles

Fixed Point Theorem in Fuzzy Metric Space with Implicit relation

This paper presents some common fixed point theorem for compatible type mapping in fuzzy metric space. Our result generalizes the result of I.Altun and D.Turkoglu [6].

 Ability of Evolutionary and Recurrent SOM model GA-RSOM in Phonemic Recognition Optimization

 The phoneme recognition aims to process a speech signal, characterized by a non-linearity with very high dynamics, allowing to perform various tasks on an information processing machine by an operator using orally...

 Feature Selection and Extraction for Content-Based Image Retrieval

 Content-Based Image Retrieval is a technique that utilizes the visual content of an image to search for similar images in large scale image databases. The visual content of an image represents the low-level feature...

Existential and Uniqueness Results for Boundary Value Problems associated with Non-linear Singular Interface Problems on Time Scales using Fixed Point Theorems

In this paper we present existential and uniqueness results for BVPs associated with 4th order nonlinear singular interface problems on Time Scales. We discuss these results using the classical fixed point theorems of Ba...

Solving a Fully Fuzzy Linear Programming Problem by Ranking

In this paper, we propose a new method for solving Fully Fuzzy linear programming Problem (FFLP) using ranking method .In this proposed ranking method, the given FFLPP is converted into a crisp linear programming (CLP) P...

Download PDF file
  • EP ID EP146148
  • DOI -
  • Views 83
  • Downloads 0

How To Cite

S. Babitha #, A. Amarajothi*, J. Baskar Babujee (2012).  Magic and Bimagic Labeling for Disconnected Graphs. INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY, 3(2), 86-90. https://europub.co.uk/articles/-A-146148