ALGORITHMIC APPROACH FOR DOMINATION NUMBER OF UNICYCLIC GRAPHS

Abstract

Let 𝐺(𝑉, 𝐸) be a unicyclic graph. A unicyclic graph is a connected graph that contains exactly one cycle. A dominating set of a graph G = (V, E) is a subset D of V, such that every vertex which is not in D is adjacent to at least one member of D. The domination number is the number of vertices in a smallest dominating set for G. In this paper I have presented an algorithmic approach to compute the domination number and the minimum domination set for the unicyclic graph. The algorithm has polynomial time complexity of 𝑂(𝑛).

Authors and Affiliations

S. V. SHINDHE

Keywords

Related Articles

TOWARDS ENERGY EFFICIENT CLOUD COMPUTING USING DEPENDENCY GRAPH

Nowadays, research are being directed in the field of large system models. These large system models generally manages the distributed environment to break down and understand behavior of the systems. A large number of...

A 3-LEVEL MULTIFACTOR AUTHENTICATION SCHEME FOR CLOUD COMPUTING

The objective of this paper is to propose a secure, user friendly and economical multi-level authentication scheme that uses multiple factors for gaining access to resource on insecure platforms and for financial trans...

DIABETES CLASSIFICATION AND PREDICTION USING ARTIFICIAL NEURAL NETWORK

The classification of data is an important field of data mining comes under supervised learning. In this approach classifier is trained on the pre-categorized data thereafter tested on unseen part called test data to e...

AN OPTIMIZED VEHICLE PARKING MECHANISM USING ARTIFICIAL NEURAL NETWORK

Our country has developed rapidly for decades with lot of commercial buildings and well contacted roads with a growing number of automobiles. The transportation industry has become the backbone of economy because of it...

A COMPARATIVE STUDY ON GOOGLE APP ENGINE AMAZON WEB SERVICES AND MICROSOFT WINDOWS AZURE

In today Internet has grown to be persistent in daily livelihood furthermore Cloud computing is a rising model where computing resources offered over the Internet as scalable, on-demand (Web) services. An association d...

Download PDF file
  • EP ID EP46533
  • DOI 10.34218/IJCET.10.2.2019.006
  • Views 204
  • Downloads 0

How To Cite

S. V. SHINDHE (2019). ALGORITHMIC APPROACH FOR DOMINATION NUMBER OF UNICYCLIC GRAPHS. International Journal of Computer Engineering & Technology (IJCET), 10(2), -. https://europub.co.uk./articles/-A-46533