Graphoidal graphs and graphoidal digraphs: a generalization of line graphs

Autor:	Subramanian Arumugam, Jay S. Bagga
Jazyk:	angličtina
Rok vydání:	2020
Předmět:	line digraph lcsh:Mathematics graphoidal graph Computer Science::Artificial Intelligence lcsh:QA1-939 Graph Vertex (geometry) law.invention Combinatorics line graph Statistics::Machine Learning law Line graph Discrete Mathematics and Combinatorics graphoidal cover Mathematics graphoidal digraph
Zdroj:	AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 2, Pp 660-664 (2020)
ISSN:	2543-3474 0972-8600
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd262684b27ee2c2f98aea40a616def9 https://doaj.org/article/b6a5db2012c44697bcae1d5ebbd3ce2e Zobrazit plný text záznamu