A Coalgebraic Model of Graphs
Journal of Advances in Mathematics and Computer Science · pp. 1–6 · Published 2 Jul 2016
10.9734/BJMCS/2016/24498Abstract
In this note, we model various types of graphs, relational systems and multisets as coalgebras over Set×Set and use the theory of coalgebras over arbitrary categories to conclude properties of the category of graphs. This point of view forces the formulation of a Co-Birkhoff like theorem for graphs.
Cited by 2
J. Padberg · International Conference on Graph Transformation · 2017
Martin Schmidt · Journal of Advances in Mathematics and Computer Science · 2018
Related research
- Construction of Picture Maze along Set of Image Dot Vertices — shares topic coverage
- Survey on Unicast, Multicast and Broadcast Routing Techniques in Vehicular Ad-hoc Networks – Present and Future — shares topic coverage
- Overview of Graph Colouring and some Ramsey-type Numbers — shares topic coverage
- Assessing Urban Road Network Connectivity Using GIS and Graph Theory in Lucknow, India — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
2
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.