Results 11 to 20 of about 1,217,420 (262)
Problem-based scaffolding for prospective mathematics teachers in graph theory course
This study aimed to give a scaffolding process to improve the preservice teachers' ability in graph theory class. The present study implemented scaffolding techniques by administering graph theory questions.
Yunita Oktavia Wulandari+2 more
doaj +1 more source
Application of practice-based learning in graph theory
Learning graph theory is an important topic in the world of mathematics and computer science. However, students often face difficulties in understanding the concepts and practical application of graph theory. Therefore, this study aims to apply practicum-
Marhadi Saputro, Iwit Prihatin
doaj +1 more source
The consecutively super edge-magic deficiency of graphs and related concepts
A bipartite graph G with partite sets X and Y is called consecutively super edge-magic if there exists a bijective function f : V(G) ⋃ E(G) → {1,2,...,|V(G)| + |E(G)|} with the property that f(X) = {1,2,...,|X|}, f(Y) = {|X|+1, |X|+2,...,|V(G)|} and f(u)+
Rikio Ichishima+2 more
doaj +1 more source
One of the concepts in mathematics that developing rapidly today is Graph Theory. The development of Graph Theory has been combined with Group Theory, that is by representing a group in a graph.
Dewi Santri Ramdani+2 more
doaj +1 more source
A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the λβ or the least sensible λ-theory ℋ (which is generated by equating all the unsolvable terms). A related question is whether, given a class of lambda models, there are a minimal λ-theory and a minimal ...
BUCCIARELLI A, SALIBRA, Antonino
openaire +3 more sources
Let be a graph of order . A numbering of is a labeling that assigns distinct elements of the set to the vertices of , where each edge of is labeled .
Rikio Ichishima+2 more
doaj +1 more source
On the K-theory of twisted higher-rank-graph C*-algebras [PDF]
We investigate the K-theory of twisted higher-rank-graph algebras by adapting parts of Elliott's computation of the K-theory of the rotation algebras.
Aidan Sims+24 more
core +3 more sources
On the strong beta-number of galaxies with three and four components
The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is if there exists no such integer .
Rikio Ichishima+2 more
doaj +1 more source
Odd harmonious labeling on the amalgamation of the generalized double quadrilateral windmill graph
Graph labeling is one of the topics of graph theory that is growing very rapidly both in terms of theory and application. A graph that satisfies the labeling property of odd harmonious is called an odd harmonious graph.
Fery Firmansah, Wed Giyarti
doaj +1 more source
On the beta-number of linear forests with an even number of components
The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is , otherwise.
Rikio Ichishima, Akito Oshima
doaj +2 more sources