UGC Approved Journal no 63975(19)

ISSN: 2349-5162 | ESTD Year : 2014
Call for Paper
Volume 11 | Issue 5 | May 2024

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 5 Issue 7
July-2018
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIR1807021


Registration ID:
183472

Page Number

106-112

Share This Article


Jetir RMS

Title

RESULTS ON THE EQUITABLE DOMINATION AND INVERSE EQUITABLE DOMINATION NUMBERS FOR SOME CLASSES OF GRAPHS

Abstract

Let G = (V, E) be a simple, finite, undirected and connected graph. A non-empty subset D of a graph 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 a minimal equitable dominating set is called an domination number of G and it is denoted by γ_e(G). Let G = (V, E) be a graph with no isolated vertices. If D is the equitable dominating set G then V-D is also an equitable dominating set of G. A non-empty subset D^'⊆V-D is an inverse equitable dominating set of G if D^' is an equitable dominating set of G. The inverse equitable domination number of G is the minimum cardinality among all the minimal inverse equitable dominating sets of G. In this paper, we established equitable and inverse equitable domination numbers for some families of graphs.

Key Words

Let G = (V, E) be a simple, finite, undirected and connected graph. A non-empty subset D of a graph 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 a minimal equitable dominating set is called an domination number of G and it is denoted by γ_e(G). Let G = (V, E) be a graph with no isolated vertices. If D is the equitable dominating set G then V-D is also an equitable dominating set of G. A non-empty subset D^'⊆V-D is an inverse equitable dominating set of G if D^' is an equitable dominating set of G. The inverse equitable domination number of G is the minimum cardinality among all the minimal inverse equitable dominating sets of G. In this paper, we established equitable and inverse equitable domination numbers for some families of graphs.

Cite This Article

"RESULTS ON THE EQUITABLE DOMINATION AND INVERSE EQUITABLE DOMINATION NUMBERS FOR SOME CLASSES OF GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 7, page no.106-112, July-2018, Available :http://www.jetir.org/papers/JETIR1807021.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"RESULTS ON THE EQUITABLE DOMINATION AND INVERSE EQUITABLE DOMINATION NUMBERS FOR SOME CLASSES OF GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 7, page no. pp106-112, July-2018, Available at : http://www.jetir.org/papers/JETIR1807021.pdf

Publication Details

Published Paper ID: JETIR1807021
Registration ID: 183472
Published In: Volume 5 | Issue 7 | Year July-2018
DOI (Digital Object Identifier):
Page No: 106-112
Country: Vellore, TamilNadu, India .
Area: Engineering
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

0002974

Print This Page

Current Call For Paper

Jetir RMS