# Iskanje po repozitoriju

 Iskalni niz: išči po NaslovAvtorOpisKljučne besedePolno besediloLeto izida INALIIN NE išči po NaslovAvtorOpisKljučne besedePolno besediloLeto izida INALIIN NE išči po NaslovAvtorOpisKljučne besedePolno besediloLeto izida INALIIN NE išči po NaslovAvtorOpisKljučne besedePolno besediloLeto izida Vrsta gradiva: Vse vrste gradiv Habilitacijsko delo (m4) Višješolska diplomska naloga (m6) Specialistično delo (m3) Diplomsko delo * (dip) Magistrsko delo * (mag) Doktorska disertacija * (dok) Raziskovalni podatki ali korpus (data) * po starem in bolonjskem študiju Jezik: Vsi jezikiSlovenski jezikAngleški jezikNemški jezikHrvaški jezikSrbski jezikBolgarski jezikBosanski jezikČeški jezikFinski jezikFrancoski jezikItalijanski jezikJaponski jezikLitvanski jezikMadžarski jezikNemški jezik (Avstrija)Norveški jezikPoljski jezikRuski jezikSlovaški jezikSrbski jezik (cirilica)Španski jezikŠvedski jezikTurški jezikNeznan jezik Išči po: RUP    FAMNIT - Fakulteta za matematiko, naravoslovje in informacijske tehnologije    FHŠ - Fakulteta za humanistične študije    FM - Fakulteta za management    FTŠ Turistica - Fakulteta za turistične študije - Turistica    FVZ - Fakulteta za vede o zdravju    IAM - Inštitut Andrej Marušič    PEF - Pedagoška fakulteta    UPR - Univerza na PrimorskemCOBISS    Fakulteta za humanistične študije, Koper    Fakulteta za management Koper in Pedagoška fakulteta Koper    Fakulteta za vede o zdravju, Izola    Knjižnica za tehniko, medicino in naravoslovje, Koper    Turistica, Portorož    Znanstveno-raziskovalno središče Koper Opcije: Prikaži samo zadetke s polnim besedilom Ponastavi

 1 - 10 / 1312 1.Hamilton paths in vertex-transitive graphs of order 10pKlavdija Kutnar, Dragan Marušič, Cui Zhang, 2012, izvirni znanstveni članekOpis: It is shown that every connected vertex-transitive graph of order ▫$10p$▫, ▫$p \ne 7$▫ a prime, which is not isomorphic to a quasiprimitive graph arising from the action of PSL▫$(2,k)$▫ on cosets of ▫$\mathbb{Z}_k \times \mathbb{Z}_{(k-1)/10}$▫, contains a Hamilton path.Najdeno v: ključnih besedahPovzetek najdenega: ...graph, vertex-transitive, Hamilton cycle, Hamilton path, automorphism group...Ključne besede: graph, vertex-transitive, Hamilton cycle, Hamilton path, automorphism groupObjavljeno: 15.10.2013; Ogledov: 1886; Prenosov: 12 Polno besedilo (0,00 KB) 2.Hamiltonicity of vertex-transitive graphs of order 4pKlavdija Kutnar, Dragan Marušič, 2008, izvirni znanstveni članekOpis: It is shown that every connected vertex-transitive graph of order ▫$4p$▫, where ▫$p$▫ is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Hamilton path.Najdeno v: ključnih besedahPovzetek najdenega: ...▫$4p$▫, where ▫$p$▫ is a prime, is hamiltonian with the exception of the Coxeter graph... ...graph theory, vertex-transitive graphs, Hamilton cycle, automorphism group...Ključne besede: graph theory, vertex-transitive graphs, Hamilton cycle, automorphism groupObjavljeno: 15.10.2013; Ogledov: 1776; Prenosov: 18 Polno besedilo (0,00 KB) 3.Hamiltonicity of cubic Cayley graphsDragan Marušič, Henry Glover, Klavdija Kutnar, Aleksander Malnič, 2012, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)Najdeno v: ključnih besedahPovzetek najdenega: ...Cayley graph, Hamilton path, Hamilton cycle, arc-transitive graph, Cayley map,...Ključne besede: Cayley graph, Hamilton path, Hamilton cycle, arc-transitive graph, Cayley mapObjavljeno: 15.10.2013; Ogledov: 1504; Prenosov: 36 Polno besedilo (0,00 KB) 4.Construction of Hamilton cycles in (2,s,3)-Cayley graphsKlavdija Kutnar, 2010, objavljeni povzetek znanstvenega prispevka na konferenciNajdeno v: ključnih besedahPovzetek najdenega: ...Hamilton cycle, Cayley graph, ...Ključne besede: Hamilton cycle, Cayley graphObjavljeno: 15.10.2013; Ogledov: 1438; Prenosov: 8 Polno besedilo (0,00 KB) 5.Hamilton paths and cycles in vertex-transitive graphs of order 6pKlavdija Kutnar, Primož Šparl, 2009, izvirni znanstveni članekOpis: It is shown that every connected vertex-transitive graph of order ▫$6p$▫, where ▫$p$▫ is a prime, contains a Hamilton path. Moreover, it is shown that, except for the truncation of the Petersen graph, every connected vertex-transitive graph of order ▫$6p$▫ which is not genuinely imprimitive contains a Hamilton cycle.Najdeno v: ključnih besedahKljučne besede: graph theory, vertex-transitive, Hamilton cycle, Hamilton path, automorphism groupObjavljeno: 15.10.2013; Ogledov: 1830; Prenosov: 14 Polno besedilo (0,00 KB) 6.On Hamiltonicity of circulant digraphs of outdegree threeŠtefko Miklavič, Primož Šparl, 2009, izvirni znanstveni članekOpis: This paper deals with Hamiltonicity of connected loopless circulant digraphs of outdegree three with connection set of the form ▫$\{a,ka,c\}$▫, where ▫$k$▫ is an integer. In particular, we prove that if ▫$k=-1$▫ or ▫$k=2$▫ such a circulant digraph is Hamiltonian if and only if it is not isomorphic to the circulant digraph on 12 vertices with connection set ▫$\{3,6,4\}$▫.Najdeno v: ključnih besedahPovzetek najdenega: ...graph theory, circulant digraph, Hamilton cycle...Ključne besede: graph theory, circulant digraph, Hamilton cycleObjavljeno: 15.10.2013; Ogledov: 1425; Prenosov: 59 Polno besedilo (0,00 KB) 7.Hamilton cycles in (2, odd, 3)-Cayley graphsHenry Glover, Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, 2012, izvirni znanstveni članekOpis: In 1969, Lovász asked if every finite, connected vertex-transitive graph has a Hamilton path. In spite of its easy formulation, no major breakthrough has been achieved thus far, and the problem is now commonly accepted to be very hard. The same holds for the special subclass of Cayley graphs where the existence of Hamilton cycles has been conjectured. In 2007, Glover and Marušič proved that a cubic Cayley graph on a finite ▫$(2, s, 3)$▫-generated group ▫$G = \langle a, x| a^2 = x^s = (ax)^3 = 1, \dots \rangle$▫ has a Hamilton path when ▫$|G|$▫ is congruent to 0 modulo 4, and has a Hamilton cycle when ▫$|G|$▫ is congruent to 2 modulo 4. The Hamilton cycle was constructed, combining the theory of Cayley maps with classical results on cyclic stability in cubic graphs, as the contractible boundary of a tree of faces in the corresponding Cayley map. With a generalization of these methods, Glover, Kutnar and Marušič in 2009 resolved the case when, apart from ▫$|G|$▫, also ▫$s$▫ is congruent to 0 modulo 4. In this article, with a further extension of the above "tree of faces" approach, a Hamilton cycle is shown to exist whenever ▫$|G|$▫ is congruent to 0 modulo 4 and s is odd. This leaves ▫$|G|$▫ congruent to 0 modulo 4 with s congruent to 2 modulo 4 as the only remaining open case. In this last case, however, the "tree of faces" approach cannot be applied, and so entirely different techniques will have to be introduced if one is to complete the proof of the existence of Hamilton cycles in cubic Cayley graphs arising from finite ▫$(2, s, 3)$▫-generated groups.Najdeno v: ključnih besedahPovzetek najdenega: ...Cayley graphs where the existence of Hamilton cycles has been conjectured. In 2007, Glover and...Ključne besede: Cayley graph, Hamilton cycle, arc-transitive graph, 1-regular action, automorphism groupObjavljeno: 15.10.2013; Ogledov: 1346; Prenosov: 68 Polno besedilo (0,00 KB) 8.Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groupsŠtefko Miklavič, Primož Šparl, 2012, izvirni znanstveni članekOpis: In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph ▫$\Gamma$▫ is ▫$n$▫-HC-extendable if it contains a path of length ▫$n$▫ and if every such path is contained in some Hamilton cycle of ▫$\Gamma$▫. Similarly, ▫$\Gamma$▫ is weakly ▫$n$▫-HP-extendable if it contains a path of length ▫$n$▫ and if every such path is contained in some Hamilton path of ▫$\Gamma$▫. Moreover, ▫$\Gamma$▫ is strongly ▫$n$▫-HP-extendable if it contains a path of length ▫$n$▫ and if for every such path $P$ there is a Hamilton path of ▫$\Gamma$▫ starting with ▫$P$▫. These concepts are then studied for the class of connected Cayley graphs on abelian groups. It is proved that every connected Cayley graph on an abelian group of order at least three is 2-HC-extendable and a complete classification of 3-HC-extendable connected Cayley graphs of abelian groups is obtained. Moreover, it is proved that every connected Cayley graph on an abelian group of order at least five is weakly 4-HP-extendable.Najdeno v: ključnih besedahKljučne besede: graph theory, Hamilton cycle, Hamilton path, n-HC-extendable, strongly n-HP-extendable, weakly n-HP-extendable, Cayley graph, abelian groupObjavljeno: 15.10.2013; Ogledov: 1368; Prenosov: 84 Polno besedilo (0,00 KB) 9.Special issue of discrete mathematics on Hamiltonicity problem for vertex-transitive (Cayley) graphsDragan Marušič, 2009, predgovor, spremna besedaNajdeno v: ključnih besedahPovzetek najdenega: ... Hamilton cycle, Hamilton path, Vetrex-transitive graph, Cayley graph,...Ključne besede: Hamilton cycle, Hamilton path, Vetrex-transitive graph, Cayley graphObjavljeno: 15.10.2013; Ogledov: 1478; Prenosov: 14 Polno besedilo (0,00 KB) 10.On cyclic edge-connectivity of fullerenesDragan Marušič, Klavdija Kutnar, 2008, izvirni znanstveni članekOpis: A graph is said to be cyclically ▫$k$▫-edge-connected, if at least ▫$k$▫ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of ▫$k$▫ edges is called a cyclic-k-edge cutset and it is called a trivial cyclic-k-edge cutset if at least one of the resulting two components induces a single ▫$k$▫-cycle. It is known that fullerenes, that is, 3-connected cubic planar graphs all of whose faces are pentagons and hexagons, are cyclically 5-edge-connected. In this article it is shown that a fullerene ▫$F$▫ containing a nontrivial cyclic-5-edge cutset admits two antipodal pentacaps, that is, two antipodal pentagonal faces whose neighboring faces are also pentagonal. Moreover, it is shown that ▫$F$▫ has a Hamilton cycle, and as a consequence at least ▫$15 \cdot 2^{n/20-1/2}$▫ perfect matchings, where ▫$n$▫ is the order of ▫$F$▫.Najdeno v: ključnih besedahPovzetek najdenega: ...it is shown that ▫$F$▫ has a Hamilton cycle, and as a consequence at least... ...it into two components, each containing a cycle. Such a set of ▫$k$▫ edges is...Ključne besede: graph, fullerene graph, cyclic edge-connectivity, hamilton cycle, perfect matchingObjavljeno: 03.04.2017; Ogledov: 812; Prenosov: 96 Polno besedilo (0,00 KB)
Iskanje izvedeno v 0 sek.
Na vrh