IJSTE

CALL FOR PAPERS : Nov 2017

Submission Last Date
25-Nov--17
Submit Manuscript Online

FOR AUTHORS

FOR REVIEWERS

ARCHIEVES

DOWNLOADS

Open Access



CopyScape
Creative Commons License

Split and Equitable Domination of Some Special Graph


Author(s):

Dr. C S Nagabhushana , HKBK College Of Engineering College; Kavitha B N, Sri Venkateshwara College Of Engineering College; H M Chudamani, A.S.C College

Keywords:

Domination, Split domination, Friendship graph? F?_n, Windmill graph Wd(m, n )

Abstract:

A subset D of V (G) is called an equitable dominating set of a graph G if for every v ∈ (V − D), there exists a vertex u ∈ D such that uv∈ E(G) and |deg(u) − deg(v)| ≤ 1. The minimum cardinality of such a dominating set is denoted by γ^e (G) and is called equitable domination number of G. A dominating set D of graph G is called a split dominating set, if the induced sub graph is disconnected. In this paper we introduce split and equitable domination of Friendship graph〖 F〗_n and Windmill graph Wd(m ,n), then we find the split and equitable domination of F_n (V-D).


Other Details:

Manuscript Id :IJSTEV4I2037
Published in :Volume : 4, Issue : 2
Publication Date: 01/09/2017
Page(s): 50-54
Download Article

IMPACT FACTOR

3.905

NEWS & UPDATES

Submit Article

Dear Authors, You can submit your article to our journal at the following link: http://www.ijste.org/Submit

Impact Factor

The Impact Factor of our Journal is 4.753 (Year - 2016)
3.905 (Year - 2015) 2.895(Year -2014)

Click Here

Submit Payment Online

Dear Authors, Now you can submit the payment receipt to our journal online at the following link: index.php?p=Payment

Index Copernicus Value

The IC Value of our journal is 69.90
Click Here

GLOBAL INDEXING



















Computer Science Directory. We are listed under Computer Research Institutes category

Share on Social media

Home | Privacy Policy | Terms & Conditions | Refund Policy | Feedback | Contact Us
Copyright © 2014 ijste.org All rights reserved