Results 1 to 10 of about 910,559 (315)
On minimal blocking sets of the generalized quadrangle $Q(4, q)$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The generalized quadrangle $Q(4,q)$ arising from the parabolic quadric in $PG(4,q)$ always has an ovoid. It is not known whether a minimal blocking set of size smaller than $q^2 + q$ (which is not an ovoid) exists in $Q(4,q)$, $q$ odd. We present results
Miroslava Cimráková, Veerle Fack
doaj +1 more source
Graph Theory and Algorithms for Network Analysis [PDF]
E3S Web of Conferences, 2023 In network analysis, the study and comprehension of complex systems in numerous fields, such as social networks, transportation networks, and biological networks, are made possible by the crucial role played by graph theory and algorithms.
Arul Sharmila Mary +5 more
doaj +1 more source
Hadamard matrices of order 36 and double-even self-dual [72,36,12] codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Before this work, at least 762 inequivalent Hadamard matrices of order 36 were known. We found 7238 Hadamard matrices of order 36 and 522 inequivalent [72,36,12] double-even self-dual codes which are obtained from all 2-(35,17,8) designs with an ...
Iliya Bouyukliev +2 more
doaj +1 more source
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
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
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
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
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