Digital repository of Slovenian research organisations

Search the repository
A+ | A- | Help | SLO | ENG

There are two search modes available: simple and advanced. Simple search can include one or more words from the title, summary, keywords or full text, but does not allow the use of search operators. Advanced search allows to limit the number of search results by entering the search terms of different categories in the search window, as well as the use of Boolean search operators (AND, OR and AND NOT). In search results short formats of records are displayed and some data are displayed as links, which open a detailed description of the material (title link) or perform a new search (author or keyword link).

Help
Search in:
Options:
 


1371 - 1380 / 2000
First pagePrevious page134135136137138139140141142143Next pageLast page
1371.
Edge-transitive cubic graphs: analysis, cataloguing and enumeration
Marston D. E. Conder, Primož Potočnik, 2026, original scientific article

Abstract: This paper deals with finite cubic (3-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-transitive and semisymmetric cubic graphs, and then these divide respectively into 7 types (according to a classification by Djoković and Miller (1980) [17]) and 15 types (according to a classification by Goldschmidt (1980) [23]), in terms of certain group amalgams. Such graphs of small order were previously known up to orders 2048 and 768, respectively, and we have extended each of the two lists of all such graphs up to order 10000. Before describing how we did that, we carry out an analysis of the 22 amalgams, to show which of the finitely-presented groups associated with the 15 Goldschmidt amalgams can be faithfully embedded in one or more of the other 21 (as subgroups of finite index), complementing what is already known about such embeddings of the 7 Djoković-Miller groups in each other. We also give an example of a graph of each of the 22 types, and in most cases, describe the smallest such graph, and we then use regular coverings to prove that there are infinitely many examples of each type. Finally, we discuss the asymptotic enumeration of the graph orders, proving that if $f_{\mathcal C}(n)$ is the number of cubic edge-transitive graphs of type ${\mathcal C}$ on at most $n$ vertices, then there exist positive real constants $a$ and $b$ and a positive integer $n_0$ such that $n^{a \log(n)} \le f_{\mathcal C}(n) \le n^{b \log(n)}$ for all $n\ge 0$.
Keywords: groups, graphs, symmetry, amalgams, cover
Published in DiRROS: 21.08.2025; Views: 266; Downloads: 134
.pdf Full text (1,64 MB)
This document has many files! More...

1372.
1373.
1374.
1375.
Comparing optimization algorithms through the lens of search behavior analysis
Gjorgjina Cenikj, Gašper Petelin, Tome Eftimov, 2025, published scientific conference contribution

Keywords: black-box single-objective numerical optimization, optimization algorithm analysis
Published in DiRROS: 20.08.2025; Views: 375; Downloads: 189
.pdf Full text (2,41 MB)
This document has many files! More...

1376.
1377.
Customized exploration of landscape features driving multi-objective combinatorial optimization performance
Ana Nikolikj, Gabriela Ochoa, Tome Eftimov, 2025, published scientific conference contribution

Keywords: landscape analysis, multi-objective combinatorial optimization, feature importance
Published in DiRROS: 20.08.2025; Views: 399; Downloads: 197
.pdf Full text (2,88 MB)
This document has many files! More...

1378.
Hybrid polymer composite of abaca-E-glass and epoxy-bamboo activated carbon nanofiller with variations in fiber orientation
L. Banowati, N. Chitraningrum, 2025, original scientific article

Keywords: hybrid, abaca, E-glass, nanofiller, epoxy, bamboo-activated carbon
Published in DiRROS: 20.08.2025; Views: 413; Downloads: 183
.pdf Full text (1,89 MB)
This document has many files! More...

1379.
Adaptive estimation of the number of algorithm runs in stochastic optimization
Tome Eftimov, Peter Korošec, 2025, published scientific conference contribution

Keywords: experimental design, number of runs, stochastic optimization algorithms
Published in DiRROS: 20.08.2025; Views: 367; Downloads: 183
.pdf Full text (1,96 MB)
This document has many files! More...

1380.
Search done in 0.73 sec.
Back to top