1. |
2. |
3. |
4. |
5. |
6. |
7. Scaffolding problems revisited : complexity, approximation and fixed parameter tractable algorithms, and some special casesMathias Weller, Annie Chateau, Clément Jean Dallard, Rodolphe Giroudeau, 2018, izvirni znanstveni članek Ključne besede: complexity, approximation, lower bound, kernel, scaffolding, {ISK4, wheel}-free graph Objavljeno v RUP: 11.02.2020; Ogledov: 1317; Prenosov: 61 Povezava na celotno besedilo |
8. |
9. Connected graphs of fixed order and size with maximal index : some spectral boundsSlobodan Simić, Francesco Belardo, Enzo M. Li Marzi, Dejan V. Tošić, 2010, objavljeni znanstveni prispevek na konferenci Ključne besede: grafi, spekter, meja, graphs, specter, bound Objavljeno v RUP: 15.10.2015; Ogledov: 2114; Prenosov: 111 Povezava na celotno besedilo |
10. A note on a geometric construction of large Cayley graps of given degree and diameterGyörgy Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2009, izvirni znanstveni članek Opis: An infinite series and some sporadic examples of large Cayley graphs with given degree and diameter are constructed. The graphs arise from arcs, caps and other objects of finite projective spaces. Ključne besede: degree, diameter problem, Moore bound, finite projective spaces Objavljeno v RUP: 15.10.2013; Ogledov: 3266; Prenosov: 69 Povezava na celotno besedilo |