Results 281 to 290 of about 3,489,698 (302)
Some of the next articles are maybe not open access.
2011
Ranking of help functions with respect to their usefulness is in the main focus of this work. In this work a help function is regarded as useful to a student if the student has succeeded to solve a problem after using it. Methods from the theory of partial orderings are further applied facilitating an automated process of suggesting individualised ...
openaire +2 more sources
Ranking of help functions with respect to their usefulness is in the main focus of this work. In this work a help function is regarded as useful to a student if the student has succeeded to solve a problem after using it. Methods from the theory of partial orderings are further applied facilitating an automated process of suggesting individualised ...
openaire +2 more sources
Ars Comb., 1998
A packing in a graph is a set of pairwise edge-disjoint subgraphs of \(G\). The density of a packing is the ratio of the total number of edges in graphs of the packing and the number of edges of \(G\); its maximum is looked for. A complete graph \(K_n\) whose vertices are labelled by \(x_1,\ldots ,x_n\) is considered.
Lorenz Halbeisen, Norbert Hungerbühler
openaire +2 more sources
A packing in a graph is a set of pairwise edge-disjoint subgraphs of \(G\). The density of a packing is the ratio of the total number of edges in graphs of the packing and the number of edges of \(G\); its maximum is looked for. A complete graph \(K_n\) whose vertices are labelled by \(x_1,\ldots ,x_n\) is considered.
Lorenz Halbeisen, Norbert Hungerbühler
openaire +2 more sources
Decomposition of complete graphs into isomorphic complete bipartite graphs
2013Summary: A decomposition of a complete graph \(K\) into disjoint copies of a complete bipartite graph \(K_{s,t}\) is called a \(K_{s,t}\)-design of order \(n\). The existence problem of \(K_{s,t}\)-designs has been completely solved for the graphs \(K_{1,t}\) for \(k\geq 1\), \(K_{2^{a},2^{b}}\) for \(a,b\geq 1\), \(K_{2, 3}\) and \(K_{3, 3}\). In this
openaire +2 more sources
Complete Graphs and Bipartite Graphs in a Random Graph
2021 5th International Conference on Vision, Image and Signal Processing (ICVISP), 2021Lijin Feng, Jackson Barr
openaire +1 more source
Counting Spanning Trees in a Complete Bipartite Graph Which Contain a Given Spanning Forest
Journal of Graph Theory, 2022Jun Ge, Fengming Dong
exaly
On Spectral Radius and Energy of Complete Multipartite Graphs
Ars Mathematica Contemporanea, 2015Masood Ur Rehman +2 more
exaly
Cycle Decompositions III: Complete Graphs and Fixed Length Cycles
Journal of Combinatorial Designs, 2002Mateja Šajna
exaly
Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
Discrete Mathematics, 2010Stanislav Jendrol' +2 more
exaly