E-viri
Recenzirano
Odprti dostop
-
Arumugam, S.; Bagga, Jay S.
AKCE international journal of graphs and combinatorics, 10/2020, Letnik: 17, Številka: 2Journal Article
A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path in Let denote the intersection graph of A graph H is called a graphoidal graph if there exists a graph G and a graphoidal cover ψ of G such that H is isomorphic to Graphoidal covers of digraphs can be similarly defined. In this article, we present a survey of known results on graphoidal graphs. We also introduce the concept of graphoidal digraphs, provide some results, and discuss several problems for further investigation.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|
Vir: Osebne bibliografije
in: SICRIS
To gradivo vam je dostopno v celotnem besedilu. Če kljub temu želite naročiti gradivo, kliknite gumb Nadaljuj.