Browse the digital library catalog

Path: /Misc. /
Abstract: Other digital works

Show only documents with full text

Subcategory
<- Back

Documents
3571 - 3580 / 17598 354 355 356 357 358 359 360 361 362 363
3571. Roots of cube polynomials of median graphs Boštjan Brešar, Sandi Klavžar, Riste Škrekovski, 2003 Keywords: matematika, teorija grafov, polinom kock, koren, medianski graf, kartezični produkt grafov, mathematics, graph theory, cube polynomial, root, median graph, Cartesian product, Published in DKUM: 10.07.2015; Views: 1564; Downloads: 126 Link to full text
3572. Cubic inflation, mirror graphs, regular maps, and partial cubes Boštjan Brešar, Sandi Klavžar, Alenka Lipovec, Bojan Mohar, 2003 Keywords: matematika, teorija grafov, vložitve grafov, baricentrična subdivizija, platonski grafi, izometrični podgrafi, hiperkocke, avtomorfizmi grafov., mathematics, graph theory, graph embeddings, barycentric subdivision, Platonic graphs, isometric subgraphs, hypercubes, graph automorphisms, Published in DKUM: 10.07.2015; Views: 1644; Downloads: 122 Link to full text
3573. Partial cubes are distance graphs Melita Gorše Pihler, Janez Žerovnik, 2005 Keywords: matematika, teorija grafov, razdaljni graf, delna kocka, hiperkocka, izometrični podgraf, vložitev, mathematics, graph theory, distance graph, partial cube, hypercube, isometric subgraph, embedding, Published in DKUM: 10.07.2015; Views: 1640; Downloads: 125 Link to full text
3574. Distance-balanced graphs Janja Jerebic, Sandi Klavžar, Douglas F. Rall, 2005 Keywords: matematika, teorija grafov, razdalja, razdaljno uravnoteženi grafi, produkti grafov, povezanost, mathematics, graph theory, graph distance, distance-balanced graphs, graph products, connectivity, Published in DKUM: 10.07.2015; Views: 2127; Downloads: 97 Link to full text
3575. Stern polynomials Sandi Klavžar, Uroš Milutinović, Ciril Petr, 2005 Keywords: matematika, Sternovo (dvoatomsko) zaporedje, Sternovi polinomi, hiperbinarna reprezentacija, standardna Grayjeva koda, nesosednja predstavitev, mathematics, Stern (diatomic) sequence, Stern polynomials, hyperbinary representation, standard Gray code, non-adjacent form, Published in DKUM: 10.07.2015; Views: 1963; Downloads: 44 Link to full text
3576. On domination numbers of graph bundles Blaž Zmazek, Janez Žerovnik, 2005 Keywords: matematika, teorija grafov, kartezični produkt grafov, dominantno število, dominantna množica, grafovski sveženj, mathematics, graph theory, graph bundle, dominating set, domination number, Cartesian product, Published in DKUM: 10.07.2015; Views: 1824; Downloads: 114 Link to full text
3577. Closed embeddings into Lipscomb's universal space Ivan Ivanšić, Uroš Milutinović, 2006 Keywords: matematika, topologija, dimenzija pokrivanja, posplošena krivulja Sierpińskega, univerzalni prostor, Lipscombov univerzalni prostor, vložitev, razširitev, poln metrični prostor, zaprta vložitev, mathematics, topology, covering dimension, embedding, closed embedding, generalized Sierpiński curve, universal space, Lipscomb universal space, complete metric space, extension, Published in DKUM: 10.07.2015; Views: 1229; Downloads: 98 Link to full text
3578. Nova knjiga pisateljice Janje Vidmar Marija Švajncer, 2025 Keywords: ocene in poročila, mladinski roman, slovenska književnost, slovenska proza Published in DKUM: 15.09.2025; Views: 172; Downloads: 11 Full text (757,09 KB) This document has many files! More...
3579. Fault-diameter of Cartesian product of graphs and Cartesian graph bundles Iztok Banič, Janez Žerovnik, 2006 Keywords: mathematics, graph theory, Cartesian graph bundles, Cartesian graph products, fault diameter, interconnection network, Published in DKUM: 10.07.2015; Views: 1332; Downloads: 59 Link to full text
3580. An optimal permutation routing algorithm for full-duplex hexagonal mesh networks Ignasi Sau Walls, Janez Žerovnik, 2006 Keywords: mathematics, hexagonal networks, permutation routing, shortest path, distributed algorithm, communication networks, oblivious algorithm, Published in DKUM: 10.07.2015; Views: 1358; Downloads: 47 Link to full text