Abstract
A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path in Let denote the intersection graph of A graph H is called a graphoidal graph if there exists a graph G and a graphoidal cover ψ of G such that H is isomorphic to Graphoidal covers of digraphs can be similarly defined. In this article, we present a survey of known results on graphoidal graphs. We also introduce the concept of graphoidal digraphs, provide some results, and discuss several problems for further investigation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.