On Harmonious Graphs
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 1
Abstract
Let G = (V (G), E(G)) be a graph with q edges. A function f is called harmonious labeling of graph G if f:V→{0,1,2,...,q-1} is injective and the induced function f* : E → {0,1,2,...,q} defined as f*(uv) = (f(u) + f(v))(mod q) is bijective. A graph which admits harmonious labeling is called harmonious graph. In this paper we prove that the jewel graph, triangular ladder graph, special flower graph, duplicating all the vertex of mK1, in P2+mK1, T(P_n ) ⨀▒K_m^c are harmonious graphs.
Authors and Affiliations
M. Teffilia
Common Fixed Point for Compatible Mappings of Type () Satisfying an Implicit Relation
Here we prove a common fixed point theorem for compatible mappings of type () satisfying an implicit relation. We extend results of Popa [9] for five mappings.
Reliability Analysis of Six Unit Bridge and Parallel Series Networks With Critical and Non-Critical Human Errors
Humans play a pivotal role in the design, development and operational phases of engineering systems. Reliability evaluation of systems without taking into consideration the human element does not provide a realistic pict...
EFFECT OF VARYING THERMAL CONDUCTIVITY AND VISCOSITY IN UNSTEADY FREE STREAM FLOW OVER STRETCHING SHEET
The aim of this paper is to investigate two dimensional unsteady flow of a viscous incompressible fluid about stagnation point on stretching sheet in the presence of time dependent free stream velocity. It is assumed tha...
On Harmonious Graphs
Let G = (V (G), E(G)) be a graph with q edges. A function f is called harmonious labeling of graph G if f:V→{0,1,2,...,q-1} is injective and the induced function f* : E → {0,1,2,...,q} defined as f*(uv) = (f(u) + f(v))(...
MAHLER MEASURE OF CHARGED GRAPHS OVER THE PURE CUBIC FIELD Q ( )
In this paper, the algebraic integer as a edge label from the pure cubic field to the all vertices of the simple graphs thereafter charges to all the vertices and get the edge labeled charged graphs. Further to find the...