Closed models, strongly connected components and Euler graphs



Document title: Closed models, strongly connected components and Euler graphs
Journal: Proyecciones (Antofagasta)
Database: PERIÓDICA
System number: 000406097
ISSN: 0716-0917
Authors: 1
Institutions: 1College Boreal, Toronto, Ontario. Canadá
Year:
Season: Jun
Volumen: 35
Number: 2
Pages: 137-157
Country: Chile
Language: Inglés
Document type: Artículo
Approach: Analítico
English abstract In this paper, we continue our study of closed models defined in categories of graphs. We construct a closed model defined in the category of directed graphs which characterizes the strongly connected components. This last notion has many applications, and it plays an important role in the web search algorithm of Brin and Page, the foundation of the search engine Google. We also show that for this closed model, Euler graphs are particular examples of cofibrant objects. This enables us to interpret in this setting the classical result of Euler which states that a directed graph is Euleurian if and only if the in degree and the out degree of every of its nodes are equal. We also provide a cohomological proof of this last result
Disciplines: Matemáticas
Keyword: Matemáticas puras,
Algebra homológica,
Teoría de categorías,
Teoría de gráficas,
Digrafos,
Gráficas de Euler
Keyword: Mathematics,
Pure mathematics,
Homological algebra,
Category theory,
Graph theory,
Digraphs,
Euler graphs
Full text: Texto completo (Ver PDF)