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	2023-02-27T15:56:35Z
dc.date.available	2023-02-27T15:56:35Z
dc.date.issued	2018
dc.identifier.citation	On a graph isomorphic to its intersection graph: self-graphoidal graphs / P.K. Das, K.R. Singh // Algebra and Discrete Mathematics. — 2018. — Vol. 26, № 2. — С. 247–255. — Бібліогр.: 11назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC: 05C38, 05C75.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/188411
dc.description.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.ispartof	Algebra and Discrete Mathematics
dc.title	On a graph isomorphic to its intersection graph: self-graphoidal graphs	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA