On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
The category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that the class of all directed graphs is a Graph I...
Saved in:
Main Authors: | Sebastian Pardo-Guerra, Vivek Kurien George, Gabriel A. Silva |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-01-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/13/2/228 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Inverse neutrosophic mixed graphs
by: Thempaavai Jayaprakash, et al.
Published: (2024-07-01) -
Homomorphisms of complete n-partite graphs
by: Robert D. Girse
Published: (1986-01-01) -
An introduction of F-graphs, a graph-theoretic representation of natural numbers
by: E. J. Farrell
Published: (1992-01-01) -
A Few-Shot Knowledge Graph Completion Model With Neighbor Filter and Affine Attention
by: Hongfang Gong, et al.
Published: (2025-01-01) -
Research on Parameter-Efficient Knowledge Graph Completion Methods and Their Performance in the Cybersecurity Field
by: Bin Chen, et al.
Published: (2025-01-01)