EQUALITY LABELING ON SPECIAL GRAPHS Dr.A.MYDEEN BIBI1 AND M.MALATHI2 1Assistant Professor of Mathematics, the Standard Firework Rajaratnam College for Women, Sivakasi 2Research Scholar the Standard Firework Rajaratnam College for Women, Sivakasi Abstract- Let G be a graph of order n and size m. A onto function : v (G) → {0,1,2,...,n} is called a equality labeling. If it satisfies following condition The edges labeled by {1,2,3,…,2m-1} with │f(u)+f(v)│ if n=m. The edges labeled by{1,2,3,…,m} with │f(u)-f(v)│if n≠m. This labeling is called an equality labeling. It is denoted by Eq (G). In this paper we investigate the behavior of equality labeling for some special graphs. Keywords- Equality labeling I. INTRODUCTION If G is a graph, let V (G) and E (G) denote, respectively, the vertex and the edge set of G. We deal with labeling with domain either the set of all vertices, or the set of all edges, or the set of all vertices and edges, respectively. We call these labeling a vertex labeling, or an edge labeling, or a total labeling, depending on the graph elements that are being labeled. The origin of this labeling is introduced by Rosa. The concept of labeling of graphs has gained a lot of popularity in the area of graph theory. This popularity is not only due to mathematical challenges of graph labeling but also to the wide range of applications that graph labeling offer to other branches of science, for instance, X-ray, crystallography, coding theory, cryptography, astronomy, circuit design and communication networks design. In the last three decades magic and antimagic labeling, prime labeling, graceful labeling, k-graceful labeling, and odd labeling, even and odd mean labeling and strongly labeling etc. have been studied in over 1300 papers. PRELIMINARIES A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links. The interconnected objects are represented by points termed as vertices, and the links that connect the vertices are called edges. Formally, a graph is a pair of sets (V, E), where V is the set of vertices and E is the set of edges, connecting the pairs of vertices. If the vertices of the graph are assigned values subject to certain conditions then it is known as graph labeling. A Path Pn is a walk in which all the vertices are distinct. A simple graph with ‘n’ vertices (n >= 3) and ‘n’ edges is called a cycle graph if all its edges form a cycle of length ‘n’. If the degree of each vertex in the graph is two, then it is called a Cycle Graph. A wheel graph is obtained from a cycle graph Cn-1 by adding a new vertex. That new vertex is called a Hub which is connected to all the vertices of Cn. The maximum of the degrees of all the vertices is called the maximum degree of the graph and it is denoted by ∆ (G) or ∆. A simple graph in which there exists an edge between every pair of vertices is called a complete graph. A graph G is called labeled if its p points are distinguished from one another by names such as v1, v2, .….vn. A graph G is connected if for every u,v ϵ G there exists a uv-path in G. Otherwise G is called DOI:10.21884/IJMTER.2018.5098.88NOJ 68 International Journal of Modern Trends in Engineering and Research (IJMTER) Volume: 5, Issue: 04, [April– 2018] ISSN (Online):2349–9745 ; ISSN (Print):2393-8161 disconnected. A graph is bipartite if its vertex set is partitioned into two nonempty subsets X and Y such that each edge of G has one end in X and the other end in Y. A complete bipartite graph is a simple bipartite graph such that two vertices are adjacent if and only if they are in different partite sets. The complete bipartite graph with partite sets of size m and n is denoted Km,n. A tree is a connected acyclic simple graph. A vertex of degree 1 is called a leaf or pendant vertex. The fan fn (n2) is obtained by joining all vertices of Pn to a further vertex called the centre and contains n+1 vertex and 2n-1 edges. A friendship graph Fn is a graph which consists of n triangle with a common vertex. A graceful labeling of a graph G of size m is an assignment of distinct elements of the set {0,1,2,…,m} to the vertices of G so that the edges labeling, which prescribes i-j to the edges joining vertices labeled i and j, assigns the labels 1,2,…,m to the edges of G. A graph possessing a graceful labeling is a graceful graph. II. DEFINITION OF EQUALITY LABELING Let G be a graph of order n and size m. A onto function : v (G) → {0,1,2,...,n} is called a equality labeling. If it satisfies following condition The edges labeled by {1,2,3,…,2m-1} with │f(u)+f(v)│ if n=m. The edges labeled by{1,2,3,…,m} with │f(u)-f(v)│if n≠m. This labeling is called an equality labeling. It is denoted by Eq (G). III. EQUALITY LABELING FOR GENERAL GRAPHS 3.1 Path: @IJMTER-2018, All rights Reserved 69 International Journal of Modern Trends in Engineering and Research (IJMTER) Volume: 5, Issue: 04, [April– 2018] ISSN (Online):2349–9745 ; ISSN (Print):2393-8161 3.2 Cycle: IV. EQUALITY LABELING FOR SPECIAL GRAPH 4.1 Diamond-Graph: A graph is diamond free if it has no diamond as an induced subgraph. The triangle free graph are diamond free graphs, since every diamond contains a triangle. 3 n≠m,n=4,m=5 1 2 3 2 1 2 1 0 @IJMTER-2018, All rights Reserved 70 International Journal of Modern Trends in Engineering and Research (IJMTER) Volume: 5, Issue: 04, [April– 2018] ISSN (Online):2349–9745 ; ISSN (Print):2393-8161 4.2 Durer-Graph: Durer’s solid is combinatorially equivalent to a cube with 2 opposite vertices truncated although durer’s depiction of it is not in this from but rather as a truncated rhombohedron or triangular truncated trapezohedron. The durer graph is the graph termed by the vertices & edges of the durer solid. It is a cubic graph of girth 3 & diameter4. 4 6 2 3 6 4 1 11 0 10 1 n≠m,n= 12,m=18 2 5 3 1 8 7 1 1 2 0 3 7 10 2 1 4 6 5 9 2 7 4.3 Bull-Graph: The bull graph is a planar undirected graph with s vertices and 5 edges in the form of a triangle with 2 disjoint pendant edges. It has chromatic number 3, chromatic 3, radius3, diameter and girth 3. It is also a block graph, a split graph, an interval graph, a claw-graph, a 1-vertex connected graph and a 1- edge- connected graph. 1 2 1 7 n=m,n=5,m=5 5 0 5 3 8 3 4.4 Butterfly- Graph: A graph is bowtie-free if it has no butterfly as an induced subgraph. The triangle-free-graph are bowtie-free graph, since every butterfly contains a triangle. The full automorphism group of the butterfly graph is a group of order 8 isomorphic to the Dihedral group D4, the group of symmetries of a square including both rotation and reflection. 1 3 3 8 n≠m,n=5,m=6 8 1 0 4 2 4 2 4.5 Franklin- Graph: The Franklin graph a 3 – regular graph with 12 vertices and 18 edges. It is hamiltonion and has chromatic number 2, chromatic index 3, radius 3, diameter 3, and girth 4.It is also a 3-vertex connected and 3 edge- connected perfect graph. @IJMTER-2018, All rights Reserved 71 International Journal of Modern Trends in Engineering and Research (IJMTER) Volume: 5, Issue: 04, [April– 2018] ISSN (Online):2349–9745 ; ISSN (Print):2393-8161 2 4 2 3 4 5 n≠m,n=12,m=18 1 6 1 9 2 1 9 3 1 1 5 2 8 0 3 0 11 2 1 5 4 1 12 5 7 4.6 Herschel- Graph: The Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges, the smallest non-hamiltonian polyhedral graph. The Herschel graph is a planar graph it can be drawn in the plane with none of its edges crossing. It is also 3-vertex connected. The removal of any 2 of its vertices leaves a connected subgraph. 4 2 8 4 2 4 6 n≠m,n=11,m=18 3 4 3 9 8 5 6 10 11 0 8 10 1 2 5 9 1 8 3 6 9 4.7 Moser- Spindle: The moser-graph (also called mosers spindle) is an undirected graph, with 7 vertices and 11 edges. It is a unit distance graph requiring 4 colors in any graph coloring. 6 1 4 n≠m,n=7,m=11 1 3 5 2 2 1 7 3 5 1 7 2 0 1 1 4.8 Wagner-Graph: The Wagner graph is a 3-regular graph with 8 vertices and 12edges. It is the 8-vertex mobius ladder graph. @IJMTER-2018, All rights Reserved 72 International Journal of Modern Trends in Engineering and Research (IJMTER) Volume: 5, Issue: 04, [April– 2018] ISSN (Online):2349–9745 ; ISSN (Print):2393-8161 1 4 7 5 8 n≠m,n=8,m=12 3 4 2 4 6 4 5 2 3 2 2 6 7 3 4 3 4.9 Hajos-Graph: The Hajós graph is another name for the Sierpiński sieve graph, which is isomorphic to the 2-sun graph.