Narodna in univerzitetna knjižnica, Ljubljana (NUK)
Naročanje gradiva za izposojo na dom
Naročanje gradiva za izposojo v čitalnice
Naročanje kopij člankov
Urnik dostave gradiva z oznako DS v signaturi
  • Relations between graphs
    Hubička, Jan ...
    Given two graphs ▫$G = (V_G, E_G)$▫ and ▫$H = (V_H, E_H)$▫, we ask under which conditions there is a relation ▫$R \subseteq V_G \times 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.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 6, no. 2, 2013, str. 323-350)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2013
    Jezik - angleški
    COBISS.SI-ID - 16706393

vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 6, no. 2, 2013, str. 323-350)

loading ...
loading ...
loading ...