Show simple item record

dc.contributor.authorDas, PK
dc.contributor.authorSingh, KR
dc.date.accessioned2019-10-21T01:30:40Z
dc.date.available2019-10-21T01:30:40Z
dc.date.issued2018
dc.identifier.issn1726-3255
dc.identifier.urihttp://hdl.handle.net/10072/388547
dc.description.abstractA 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.
dc.description.peerreviewedYes
dc.publisherLuhansk Taras Shevchenko National University
dc.publisher.urihttp://admjournal.luguniv.edu.ua/index.php/adm/article/view/149
dc.relation.ispartofpagefrom247
dc.relation.ispartofpageto255
dc.relation.ispartofissue2
dc.relation.ispartofjournalAlgebra and Discrete Mathematics
dc.relation.ispartofvolume26
dc.subject.fieldofresearchPure Mathematics
dc.subject.fieldofresearchcode0101
dc.titleOn a graph isomorphic to its intersection graph: Self-graphoidal graphs
dc.typeJournal article
dc.type.descriptionC1 - Articles
dcterms.bibliographicCitationDas, PK; Singh, KR, On a graph isomorphic to its intersection graph: Self-graphoidal graphs, Algebra and Discrete Mathematics, 2018, 26 (2), pp. 247-255
dc.date.updated2019-10-21T00:43:09Z
gro.hasfulltextNo Full Text
gro.griffith.authorSingh, Kuljit


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record