Cargando…
Entropy, Graph Homomorphisms, and Dissociation Sets
Given two graphs G and H, the mapping of [Formula: see text] is called a graph homomorphism from G to H if it maps the adjacent vertices of G to the adjacent vertices of H. For the graph G, a subset of vertices is called a dissociation set of G if it induces a subgraph of G containing no paths of or...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9858558/ https://www.ncbi.nlm.nih.gov/pubmed/36673303 http://dx.doi.org/10.3390/e25010163 |