(k, d)-MEAN LABELING OF SOME DISCONNECTED GRAPHS
Journal: INTERNATIONAL JOURNAL OF RESEARCH -GRANTHAALAYAH (Vol.5, No. 7)Publication Date: 2017-07-30
Authors : B. Gayathri; V. Sulochana;
Page : 31-41
Keywords : (k; d)-Mean Labeling; (k; d)-Mean Graph.;
Abstract
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.
Other Latest Articles
- A COMPARATIVE ANALYSIS FOR SMART WATER RESOURCE USING DATA MINING TOOLS
- A STUDY ON JOB SATISFACTION OF BANK EMPLOYEES (WITH SPECIAL REFERENCE TO INDIAN BANK-VELLORE CITY)
- EDUCATIONAL PAGES IN FACEBOOK - A STUDY
- GOODS AND SERVICES TAX - AN OVERVIEW
- AUTHORSHIP PATTERN & COLLABORATION IN ETRI JOURNAL: A SCIENTROMETRIC STUDY
Last modified: 2017-08-17 18:09:49