Some properties of n-cut splicing on labelled semigraphs
A semigraph is one of the generalization of graphs. Different from the hypergraph, a semigraph generalizes a graph in a straightforward manner where the edges of the graph are depicted as usual lines as in a graph, instead of sets as in a hypergraph. The vertices of the semigraph can be labelled by...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2023
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/108262/ http://dx.doi.org/10.1063/5.0183227 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!