E-viri
-
Araujo-Pardo, C.; Balbuena, C.; Miller, M.; Ždímalová, M.
Electronic notes in discrete mathematics, October 2016, 2016-10-00, Letnik: 54Journal Article
A mixed graph is said to be dense, if its order is close to the Moore bound and it is optimal if there is not a mixed graph with the same parameters and bigger order. We give a construction that provides dense mixed graphs of undirected degree q, directed degree q−12 and order 2q2, for q being an odd prime power. Since the Moore bound for a mixed graph with these parameters is equal to 9q2−4q+34 the defect of these mixed graphs is (q−22)2−14. In particular we obtain a known mixed Moore graph of order 18, undirected degree 3 and directed degree 1, called Bosák's graph and a new mixed graph of order 50, undirected degree 5 and directed degree 2, which is proved to be optimal.
![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.