Results 11 to 20 of about 8,504,362 (373)
On the enumeration of uniquely reducible double designs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A double $2$-$(v,k,2 \lambda)$ design is a design which is reducible into two $2$-$(v,k,\lambda)$ designs. It is called uniquely reducible if it has, up to equivalence, only one reduction.
Veerle Fack +2 more
doaj +1 more source
On (a,d)-antimagic labelings of Hn, FLn and mCn
Indonesian Journal of Combinatorics, 2020 In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic.
Ramalakshmi Rajendran, K. M. Kathiresan
doaj +1 more source
Problem-based scaffolding for prospective mathematics teachers in graph theory course
International Journal of Trends in Mathematics Education Research, 2023 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
Scattering theory on graphs [PDF]
Journal of Physics A: Mathematical and General, 2001 We consider the scattering theory for the Schr dinger operator $-\Dc_x^2+V(x)$ on graphs made of one-dimensional wires connected to external leads. We derive two expressions for the scattering matrix on arbitrary graphs. One involves matrices that couple arcs (oriented bonds), the other involves matrices that couple vertices.
Texier, Christophe, Montambaux, Gilles
openaire +5 more sources
Application of practice-based learning in graph theory
International Journal of Trends in Mathematics Education Research, 2023 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
Odd harmonious labeling on the amalgamation of the generalized double quadrilateral windmill graph
Desimal, 2021 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
A Guide to Conquer the Biological Network Era Using Graph Theory
Frontiers in Bioengineering and Biotechnology, 2020 Networks are one of the most common ways to represent biological systems as complex sets of binary interactions or relations between different bioentities.
Mikaela Koutrouli +3 more
semanticscholar +1 more source
Mathematical Structures in Computer Science, 2008 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 +4 more sources
AKCE International Journal of Graphs and Combinatorics, 2020 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
The consecutively super edge-magic deficiency of graphs and related concepts
Electronic Journal of Graph Theory and Applications, 2020 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