Inverse domination in circular arc graphs

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2018

Full metadata record

DC Field	Value	Language
dc.contributor.author	Purushotham P
dc.contributor.author	Rama Latha V
dc.contributor.author	Manjunath G
dc.date.accessioned	2022-05-26T05:23:28Z	-
dc.date.available	2022-05-26T05:23:28Z	-
dc.date.issued	2020
dc.identifier.citation	European journal of Moleculur and clinical medicine
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/2018	-
dc.description.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
dc.format.extent	7 (8)
dc.language.iso	en
dc.publisher	Ubiquity Press
dc.title	Inverse domination in circular arc graphs
dc.type	Article
Appears in Collections:	Mathematics Department

Files in This Item:

File	Size	Format
SOE-Mathematics-16.pdf	90.7 kB	Adobe PDF	View/Open

DSpace JSPUI