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

Chacko, B.; Dominic, C.; Premodkumar, K. P.(ДЗ "ЛНУ імені Тараса Шевченка", 2019)

In [10], the notion of the splitting graph of a graph
was introduced. In this paper we compute the zero forcing number
of the splitting graph of a graph and also obtain some bounds
besides finding the exact value of ...

Magic rectangles are a classical generalization of
the well-known magic squares, and they are related to graphs. A
graph G is called degree-magic if there exists a labelling of the edges
by integers 1, 2, . . . , |E(G)| ...

Protasov, I. V.(ДЗ "ЛНУ імені Тараса Шевченка", 2019)

In this paper, exact sequences of graphs are
defined and investigated. Considering some functors on the category
of graphs, we study some conditions to determine exactness of
functors.