Homomorphisms of complete n-partite graphs
It is shown that for every homomorphism ϕ of a graph G there exists a contraction θϕ on G¯, the complement of G, such that ϕ(G)¯=θϕ(G¯) if and only if G is a complete n-partite graph.
Saved in:
Main Author: | Robert D. Girse |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1986-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171286000224 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Homomorphism and sigma polynomials
by: Richard Alan Gillman
Published: (1995-01-01) -
Graph partition based mapping algorithm on multiprocessors for streaming applications
by: Qi TANG, et al.
Published: (2016-06-01) -
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
by: Sebastian Pardo-Guerra, et al.
Published: (2025-01-01) -
Homomorphic and restricted homomorphic products of softgraphs
by: Jinta Jose, et al.
Published: (2025-01-01) -
LGP-SA:Graph partition algorithm based on simulated annealing in large-scale graph processing
by: Jinfeng XU, et al.
Published: (2016-02-01)