Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/4546
Title: On a graph isomorphic to its intersection graph: self-graphoidal graphs
Authors: Das, P.K.
Singh, K.R.
Keywords: graphoidal cover
graphoidal covering number
graphoidal graph
self-graphoidal graph
Issue Date: 2018
Publisher: ДЗ "ЛНУ імені Тараса Шевченка"
Series/Report no.: математичні науки;
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.
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
URI: http://hdl.handle.net/123456789/4546
Appears in Collections:Algebra and Discrete Mathematics. - № 2 (26). - 2018

Files in This Item:
File Description SizeFormat 
149-3846-1-PB.pdf322.53 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.