Split Perfect Total Domination of an Interval Graph

Author(s)	A. Sudhakaraiah, K. Mahaboob Basha, E. Gnanadeepika
Country	India
Abstract	A Set S of vertices in a graph G(V,E) is called a dominating set,if every vertex v V id either an element of S or is adjacent to an element of S. A Set S of vertice in a graph G(V,E) is called a Total dominating set if every vertex v V is adjacent to an element of S, or a total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. In this paper we will find the perfect total dominating set of an Interval graph. We also find out the vertex induced subgraph regarding perfect total dominating set which were splitted.
Keywords	Interval graph, Dominating set, Total dominating set, Split-dominating set and perfect total dominating set of an interval graph.
Field	Mathematics
Published In	Volume 5, Issue 1, January-February 2023
Published On	2023-02-28
Cite This	Split Perfect Total Domination of an Interval Graph - A. Sudhakaraiah, K. Mahaboob Basha, E. Gnanadeepika - IJFMR Volume 5, Issue 1, January-February 2023. DOI 10.36948/ijfmr.2023.v05i01.1697
DOI	https://doi.org/10.36948/ijfmr.2023.v05i01.1697
Short DOI	https://doi.org/grwbhk

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9898-5948-55	editor@ijfmr.com

International Journal For Multidisciplinary Research