International Journal of Mathematics and Soft Computing, 2011
In this paper, we introduce the concept of (k, d)-even mean labeling and investigate (k, d)-even ... more In this paper, we introduce the concept of (k, d)-even mean labeling and investigate (k, d)-even mean labeling of P m nK 1 .
A $(p,q)$ graph $G$ is said to have a $k$-odd mean labeling $(k ge 1)$ if there exists an in... more A $(p,q)$ graph $G$ is said to have a $k$-odd mean labeling $(k ge 1)$ if there exists an injection $f : V to {0, 1, 2, ldots, 2k + 2q - 3}$ such that the induced map $f^*$ defined on $E$ by $f^*(uv) = leftlceil frac{f(u)+f(v)}{2}rightrceil$ is a bijection from $E$ to ${2k - 1, 2k + 1, 2k + 3, ldots, 2 k + 2q - 3}$. A graph that admits $k$-odd mean labeling is called $k$-odd mean graph. In this paper, we investigate $k$-odd mean labeling of prism $C_m times P_n$.
Rosa [13] introduced the notion of graceful labelings. The concept of magic, antimagic and cons... more Rosa [13] introduced the notion of graceful labelings. The concept of magic, antimagic and conservative labelings have been extended to directed graphs [11]. Bloom and Hsu [3, 4, 5] extended the notion of graceful labeling to directed graphs. In 1985, Lo [12] introduced the notion of edge – graceful graphs. We introduced [8] the concept of edge – graceful labelings to directed graphs and further studied in [9]. In this paper we investigate directed edge – graceful labeling of cycle and star related graphs.
Abstract: Graham and Sloane [7] introduced the harmonious graphs and Singh & Varkey [8] introduce... more Abstract: Graham and Sloane [7] introduced the harmonious graphs and Singh & Varkey [8] introduced the odd sequential graphs. Gayathri & Hemalatha [2] introduced even sequential harmonious labeling of graphs. We studied even sequential harmonious labeling of trees in [3]. In [4], we have extended this notion to k-even sequential harmonious labeling graphs. It is further studied in [5]. k-even sequential harmonious labeling of some cycle related graphs are studied in [6 ]. Also, we have introduced k-odd sequential harmonious labeling of graphs in [5]. In this paper, we investigate k-odd sequential harmonious labeling of some graphs.
Mean labeling of graphs was discussed in [10] and the concept of odd mean labeling was introduced... more Mean labeling of graphs was discussed in [10] and the concept of odd mean labeling was introduced in [9]. k -odd mean labeling and ( k , d ) - odd mean labeling are introduced and discussed in [5], [6], [7]. In this paper, we introduce the concept of ( k , d ) – even mean labeling and investigate ( k , d ) – even mean labeling of           P m  nK 1 .
International Journal of Research -GRANTHAALAYAH, 2017
The concept of mean labeling was introduced by Somasundaram and Ponraj. K-odd mean, (k,d)-odd mea... more The concept of mean labeling was introduced by Somasundaram and Ponraj. K-odd mean, (k,d)-odd mean labeling were introduced and discussed by Gayathri and Amuthavalli. K-mean, k-even mean and (k,d)-even mean labeling were further studied by Gayathri and Gopi. We have obtained (k,1)-mean labeling for some new families of graphs. We have introduced (k,d)-mean labeling and obtained results for some family of trees and for some special graphs. In this paper, we investigate (k,d)-mean labeling for some disconnected graphs. Here k and d denote any positive integer greater than or equal to 1.
Journal of Discrete Mathematical Sciences and Cryptography, 2019
A graph G = (p, q) is said to have a restricted k-mean labeling if there is an injective function... more A graph G = (p, q) is said to have a restricted k-mean labeling if there is an injective function f from the vertices of G to {k-1, k, k + 1, , k + q-1} such that when each edge uv is labeled with () () 2 () f u f v f uv * + = then the resulting edge labels {k, k + 1, k + 2, , k + q-1} are all distinct where k is a positive integer greater than or equal to one. A graph that admits a restricted k-mean labeling is called a restricted k-mean graph.
International Journal of Engineering & Technology, 2018
Since its inception, the notion of domination has found vital roles in several real life applicat... more Since its inception, the notion of domination has found vital roles in several real life applications related to facility locations, representatives’ selection, communication networks, electrical networks, etc. The vast application of the notion has paved the way for the development of the notion with several types. The notion of connected domination is a significant domination parameter amongst the several domination varieties emerged in this domain. The problem of determining limited bus stops in a route was effectively addressed by the connected domination parameter. Most of the biological and neural networks effectively use this notion to solve several problems which require the connectedness of the structures. In view of the growing applications of the variant, several researchers and scholars have published numerous research articles on the said parameter. Recently, some researchers attempted on transition of the domination parameter into a connected one. In order to facilitat...
International Journal of Science and Research (IJSR), 2016
Mean labeling of graphs was discussed in [24-25] and the concept of odd mean labeling was introdu... more Mean labeling of graphs was discussed in [24-25] and the concept of odd mean labeling was introduced in [22]. kodd mean labeling and (k,d)odd mean labeling are introduced and discussed in [1,6-8]. kmean, keven mean and (k,d)even mean labeling are introduced and discussed in [9-17]. In this paper, we introduce (k,d)mean labeling and we have obtained results for some family of trees.
Uploads
Papers by Dr. B Gayathri