DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/2018| Title: | Inverse domination in circular arc graphs |
| Authors: | Purushotham P Rama Latha V Manjunath G |
| Issue Date: | 2020 |
| Publisher: | Ubiquity Press |
| Citation: | European journal of Moleculur and clinical medicine |
| Abstract: | The intersection graph of a set of arcs on the circle is called a circular-arc graph. Circular-arc has one vertex for each arc in the set and an edge between every pair of vertices corresponding to arcs that intersect. Let 1 2 { , ,....., } C c c c = n be family of arcs on a circle. In this paper we are taking circular arcs such that if we remove 1 c then there will be a disconnection between left end side intersecting arc of 1 c and right end side intersecting arcs of 1 c .We are writing an algorithm to find an inverse of dominating set with respect to a minimum dominating set of a circular-arc family |
| URI: | http://localhost:8080/xmlui/handle/123456789/2018 |
| Appears in Collections: | Mathematics Department |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| SOE-Mathematics-16.pdf | 90.7 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.