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) -
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
by: Sebastian Pardo-Guerra, et al.
Published: (2025-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) -
CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
by: Nhu An Do, et al.
Published: (2024-02-01)