Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


11 - 20 / 27
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
11.
Special issue of discrete mathematics on Hamiltonicity problem for vertex-transitive (Cayley) graphs
Dragan Marušič, 2009, predgovor, spremna beseda

Najdeno v: ključnih besedah
Povzetek najdenega: ...Hamilton cycle, Hamilton path, Vetrex-transitive graph, Cayley graph, ...
Ključne besede: Hamilton cycle, Hamilton path, Vetrex-transitive graph, Cayley graph
Objavljeno: 15.10.2013; Ogledov: 1412; Prenosov: 14
URL Polno besedilo (0,00 KB)

12.
Arc-transitive cycle decompositions of tetravalent graphs
Štefko Miklavič, Primož Potočnik, Stephen Wilson, 2008, izvirni znanstveni članek

Opis: A cycle decomposition of a graph ▫$\Gamma$▫ is a set ▫$\mathcal{C}$▫ of cycles of ▫$\Gamma$▫ such that every edge of ▫$\Gamma$▫ belongs to exactly one cycle in ▫$\mathcal{C}$▫. Such a decomposition is called arc-transitive if the group of automorphisms of ▫$\Gamma$▫ that preserve setwise acts transitively on the arcs of ▫$\Gamma$▫. In this paper, we study arc-transitive cycle decompositions of tetravalent graphs. In particular, we are interested in determining and enumerating arc-transitive cycle decompositions admitted by a given arc-transitive tetravalent graph. Among other results we show that a connected tetravalent arc-transitive graph is either 2-arc-transitive, or is isomorphic to the medial graph of a reflexible map, or admits exactly one cycle structure.
Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: mathematics, graph theory, cycle decomposition, automorphism group, consistent cycle, medial maps
Objavljeno: 15.10.2013; Ogledov: 1490; Prenosov: 54
URL Polno besedilo (0,00 KB)

13.
On cyclic edge-connectivity of fullerenes
Dragan Marušič, Klavdija Kutnar, 2008, izvirni znanstveni članek

Opis: 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 besedah
Povzetek najdenega: ...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 matching
Objavljeno: 03.04.2017; Ogledov: 758; Prenosov: 94
URL Polno besedilo (0,00 KB)

14.
Določeni razredi (hiper)grafov in njihove algebraične lastnosti
Paweł Petecki, 2016, doktorska disertacija

Najdeno v: ključnih besedah
Povzetek najdenega: ...hypergraph, hamiltonian cycle, decomposition, double generalized Petersen graph, automorphism group,...
Ključne besede: hypergraph, hamiltonian cycle, decomposition, double generalized Petersen graph, automorphism group, vertex-transitive, sign graph, L-eigenvalue, lollipop graph
Objavljeno: 09.08.2016; Ogledov: 1499; Prenosov: 3
URL Polno besedilo (0,00 KB)

15.
The price of connectivity for cycle transversals
Tatiana R. Hartinger, Matthew Johnson, Martin Milanič, Daniël Paulusma, 2015, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: price of connectivity, hereditary graph class, path, cycle, transversal
Objavljeno: 08.08.2016; Ogledov: 1450; Prenosov: 54
URL Polno besedilo (0,00 KB)

16.
The price of connectivity for cycle transversals
Tatiana R. Hartinger, Matthew Johnson, Martin Milanič, Daniël Paulusma, 2016, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: price of connectivity, hereditary graph class, path, cycle, transversal
Objavljeno: 08.08.2016; Ogledov: 900; Prenosov: 49
URL Polno besedilo (0,00 KB)

17.
Nove karakterizacije v strukturni teoriji grafov
Tatiana Romina Hartinger, 2017, doktorska disertacija

Najdeno v: ključnih besedah
Povzetek najdenega: ...direct product, strong product, price of connectivity, cycle transversal, path transversal...
Ključne besede: 1-perfectly orientable graph, structural characterization of families of graphs, chordal graph, interval graph, circular arc graph, cograph, block-cactus graph, cobipartite graph, K4-minor-free graph, outerplanar graph, graph product, Cartesian product, lexicographic product, direct product, strong product, price of connectivity, cycle transversal, path transversal
Objavljeno: 09.11.2017; Ogledov: 646; Prenosov: 10
URL Polno besedilo (0,00 KB)

18.
Life cycle assessment - opportunities for forest products sector
Andreja Kutnar, Callum A. S. Hill, 2017, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: environmental impact, environmental product declaration (EPD), forest products, life cycle assessment (LCA), O-LCA, product category rules (PCR), S-LCA, wood
Objavljeno: 15.11.2017; Ogledov: 911; Prenosov: 28
URL Polno besedilo (0,00 KB)

19.
On structural results of tetravalent half-arc-transitive graphs
Primož Šparl, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: ključnih besedah
Povzetek najdenega: ...graph, half-arc-transitive, alternating cycle, radius...
Ključne besede: graph, half-arc-transitive, alternating cycle, radius
Objavljeno: 07.02.2018; Ogledov: 554; Prenosov: 13
URL Polno besedilo (0,00 KB)

20.
On reflexible polynomials
Aleksander Malnič, Boštjan Kuzman, Primož Potočnik, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: ključnih besedah
Povzetek najdenega: ...minimal elementary abelian cover, doubled cycle, polynomial...
Ključne besede: minimal elementary abelian cover, doubled cycle, polynomial
Objavljeno: 07.02.2018; Ogledov: 1280; Prenosov: 13
URL Polno besedilo (0,00 KB)

Iskanje izvedeno v 0 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici