21. Local action groups and rural development projectsAlenka Volk, Štefan Bojnec, 2012, published scientific conference contribution Abstract: This paper analyses the influence of a formal and informal system of the Local Action Group (LAG) board's performance on the perception of its members about suitability of rural development projects for LEADER funds co-financing.The unique in-depth survey data was obtained from the surveys with the 103 LAG boardćs members using the written questionnaire designed for the inquiry and from existing data analysis on projects which were co-financedby the LEADER funds in Slovenia in the years 2008 and 2009. The informal system of performance of the LAG board members was found to influence significantly its members' perception on the suitability of projects to be co-financed by the LEADER axis. The opposite was established for the formal system, which had insignificant influence on the board members' perception on the suitability of projects. Found in: ključnih besedah Summary of found: ...and informal system of the Local Action Group (LAG) board's performance on the perception of... Keywords: LEADER, rural development projects, board members, Local Action Group, formal system, informal system Published: 15.10.2013; Views: 1306; Downloads: 20 Full text (0,00 KB) |
22. Hamilton paths and cycles in vertex-transitive graphs of order 6pKlavdija Kutnar, Primož Šparl, 2009, original scientific article Abstract: 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. Found in: ključnih besedah Keywords: graph theory, vertex-transitive, Hamilton cycle, Hamilton path, automorphism group Published: 15.10.2013; Views: 1627; Downloads: 14 Full text (0,00 KB) |
23. Classification of edge-transitive rose window graphsIstván Kovács, Klavdija Kutnar, Dragan Marušič, 2010, original scientific article Abstract: Given natural numbers ▫$n \ge 3$▫ and ▫$1 \le a$▫, ▫$r \le n-1$▫, the rose window graph ▫$R_n(a,r)$▫ is a quartic graph with vertex set ▫$\{x_i \vert i \in {\mathbb Z}_n\} \cup \{y_i \vert i \in {\mathbb Z}_n\}$▫ and edge set ▫$\{\{x_i, x_{i+1}\} \vert i \in {\mathbb Z}_n\} \cup \{\{y_i, y_{i+r}\} \vert i \in {\mathbb Z}_n\} \cup \{\{x_i, y_i\} \vert i \in {\mathbb Z}_n\} \cup \{\{x_{i+a}, y_i\} \vert i \in {\mathbb Z}_n\}$▫. In this article a complete classification of edge-transitive rose window graphs is given, thus solving one of three open problems about these graphs posed by Steve Wilson in 2001. Found in: ključnih besedah Summary of found: ... group, graph, rose window, vertex-transitive, edge-transitive, arc-transitive... Keywords: group, graph, rose window, vertex-transitive, edge-transitive, arc-transitive Published: 15.10.2013; Views: 1305; Downloads: 47 Full text (0,00 KB) |
24. On cubic non-Cayley vertex-transitive graphsKlavdija Kutnar, Dragan Marušič, Cui Zhang, 2012, original scientific article Found in: ključnih besedah Summary of found: ...vertex-transitive graph, non-Cayley graph, automorphism group, ... Keywords: vertex-transitive graph, non-Cayley graph, automorphism group Published: 15.10.2013; Views: 1235; Downloads: 59 Full text (0,00 KB) |
25. |
26. Hamilton cycles in (2, odd, 3)-Cayley graphsHenry Glover, Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, 2012, original scientific article Abstract: 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. Found in: ključnih besedah Summary of found: ...graph on a finite ▫$(2, s, 3)$▫-generated group ▫$G = \langle a, x| a^2 =... Keywords: Cayley graph, Hamilton cycle, arc-transitive graph, 1-regular action, automorphism group Published: 15.10.2013; Views: 1215; Downloads: 56 Full text (0,00 KB) |
27. Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groupsŠtefko Miklavič, Primož Šparl, 2012, original scientific article Abstract: 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. Found in: ključnih besedah Summary of found: ...class of connected Cayley graphs on abelian groups. It is proved that every connected Cayley... Keywords: graph theory, Hamilton cycle, Hamilton path, n-HC-extendable, strongly n-HP-extendable, weakly n-HP-extendable, Cayley graph, abelian group Published: 15.10.2013; Views: 1223; Downloads: 70 Full text (0,00 KB) |
28. |
29. On vertex-stabilizers of bipartite dual polar graphsŠtefko Miklavič, 2010, original scientific article Abstract: Let ▫$X,Y$▫ denote vertices of a bipartite dual polar graph, and let ▫$G_X$▫ and ▫$G_Y$▫ denote the stabilizers of ▫$X$▫ and ▫$Y$▫ in the full automorphism group of this graph. In this paper, a description of the orbits of ▫$G_X \cap G_Y$▫ in the cases when the distance between ▫$X$▫ and ▫$Y$▫ is 1 or 2, is given. Found in: ključnih besedah Summary of found: ...▫$X$▫ and ▫$Y$▫ in the full automorphism group of this graph. In this paper, a... Keywords: dual polar graphs, automorphism group, quadratic form, isotropic subspace Published: 15.10.2013; Views: 1344; Downloads: 54 Full text (0,00 KB) |
30. |