Results 1 to 10 of about 6,904,652 (331)
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 +2 more sources
Inventions, 2020 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
Graph theory methods for analyzing functional connectivity in multiple spike trains: application to data recorded from the visual cortex of a cat. [PDF]
Cogn NeurodynMasud MS +3 more
europepmc +3 more sources
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
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
MAGUS: machine learning and graph theory assisted universal structure searcher
National Science Review, 2023 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
Environmental evolutionary graph theory [PDF]
Journal of Theoretical Biology, 2014 Understanding the influence of an environment on the evolution of its resident population is a major challenge in evolutionary biology. Great progress has been made in homogeneous population structures while heterogeneous structures have received relatively less attention.
Maciejewski, Wes, Puleo, Gregory J.
openaire +4 more sources
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