At Most Twin Outer Perfect Domination Number Of A Graph

Main Article Content

G. Mahadevan, et. al.

Abstract

A Set  In A Graph G Is Said To Be At Most Twin Outer Perfect Dominating Set If For Every Vertex ,  And  Has At Least One Perfect Matching. The Minimum Cardinality Of At Most Twin Outer Perfect Dominating Set Is Called At Most Twin Outer Perfect Domination Number And Is Denoted By . In This Paper, We Initiate A Study Of This Parameter.

Article Details

Section
Articles