Results 1 to 10 of about 6,842,347 (210)
Graph Theory and Algorithms for Network Analysis [PDF]
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 +2 more sources
Graph theory (GT) concepts are potentially applicable in the field of computer science (CS) for many purposes. The unique applications of GT in the CS field such as clustering of web documents, cryptography, and analyzing an algorithm’s execution ...
Abdul Majeed, Ibtisam Rauf
doaj +2 more sources
MAGUS: machine learning and graph theory assisted universal structure searcher
Crystal structure predictions based on first-principles calculations have gained great success in materials science and solid state physics. However, the remaining challenges still limit their applications in systems with a large number of atoms ...
Junjie Wang +9 more
semanticscholar +1 more source
On minimal blocking sets of the generalized quadrangle $Q(4, q)$ [PDF]
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
Hadamard matrices of order 36 and double-even self-dual [72,36,12] codes [PDF]
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]
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
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
Graph Neural Networks for Wireless Communications: From Theory to Practice [PDF]
Deep learning-based approaches have been developed to solve challenging problems in wireless communications, leading to promising results. Early attempts adopted neural network architectures inherited from applications such as computer vision. They often
Yifei Shen +3 more
semanticscholar +1 more source
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

