Results 11 to 20 of about 2,078,525 (187)
Discrete Signal Processing on Graphs: Sampling Theory [PDF]
, 2015 We propose a sampling theory for signals that are supported on either directed or undirected graphs. The theory follows the same paradigm as classical sampling theory.
Chen, Siheng +3 more
core +2 more sources
Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI [PDF]
, 2017 With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI)
Dragotti, Pier Luigi +1 more
core +2 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
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
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
Barekeng, 2022 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