Relations between graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10372499" target="_blank" >RIV/00216208:11320/13:10372499 - isvavai.cz</a>

Result on the web

<a href="https://amc-journal.eu/index.php/amc/article/view/335/228" target="_blank" >https://amc-journal.eu/index.php/amc/article/view/335/228</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Relations between graphs

Original language description

Given two graphs G = (V-G,V- E-G) and H = (V-H, E-H), we ask under which conditions there is a relation R subset of V-G x V-H that generates the edges of H given the structure of the graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective homomorphisms of graphs and naturally leads to notions of R-retractions, R-cores, and R-cocores of graphs. Both R-cores and R-cocores of graphs are unique up to isomorphism and can be computed in polynomial time.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Ars Mathematica Contemporanea

ISSN

1855-3966

e-ISSN

—

Volume of the periodical

6

Issue of the periodical within the volume

2

Country of publishing house

SI - SLOVENIA

Number of pages

28

Pages from-to

323-350

UT code for WoS article

000320232100014

EID of the result in the Scopus database

—