On a graph isomorphic to its intersection graph: self-graphoidal graphs

dc.contributor.author	Das, P.K.
dc.contributor.author	Singh, K.R.
dc.date.accessioned	2019-12-17T08:25:16Z
dc.date.available	2019-12-17T08:25:16Z
dc.date.issued	2018
dc.identifier.uri	http://hdl.handle.net/123456789/4546
dc.description	Das P.K. On a graph isomorphic to its intersection graph: self-graphoidal graphs / P.K. Das, K. R. Singh // Algebra and Discrete Mathematics. - 2018. - Vol. 26. - Number 2. - Рp. 247-255	uk_UA
dc.description.abstract	Abstract . A graph G is called a graphoidal graph if there exists a graph H and a graphoidal cover ψ of H such that G ∼= Ω(H, ψ). Then the graph G is said to be self-graphoidal if it is isomorphic to one of its graphoidal graphs. In this paper, we have examined the existence of a few self-graphoidal graphs from path length sequence of a graphoidal cover and obtained new results on self-graphoidal graphs.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	ДЗ "ЛНУ імені Тараса Шевченка"	uk_UA
dc.relation.ispartofseries	математичні науки;
dc.subject	graphoidal cover	uk_UA
dc.subject	graphoidal covering number	uk_UA
dc.subject	graphoidal graph	uk_UA
dc.subject	self-graphoidal graph	uk_UA
dc.title	On a graph isomorphic to its intersection graph: self-graphoidal graphs	uk_UA
dc.type	Article	uk_UA