Results 21 to 30 of about 55,177 (267)
, 2023 AbstractThe spectra of metric equilateral metric graphs are essentially determined by the spectra of the normalised or averaging Laplacian matrices associated with the corresponding discrete graphs.
openaire +1 more source
Discrete Density Comonads and Graph Parameters
, 2022 Game comonads have brought forth a new approach to studying finite model theory categorically. By representing model comparison games semantically as comonads, they allow important logical and combinatorial properties to be exressed in terms of their Eilenberg-Moore coalgebras.
Samson Abramsky +2 more
openaire +2 more sources
Crossing Numbers of Join Product with Discrete Graphs: A Study on 6-Vertex Graphs
Mathematics, 2023 Reducing the number of crossings on graph edges can be useful in various applications, including network visualization, circuit design, graph theory, cartography or social choice theory.
Jana Fortes, Michal Staš
doaj +1 more source
Graph‐like spaces approximated by discrete graphs and applications
Mathematische Nachrichten, 2021 AbstractWe define a distance between energy forms on a graph‐like metric measure space and on a suitable discrete weighted graph using the concept of quasi‐unitary equivalence. We apply this result to metric graphs, graph‐like manifolds (e.g. a small neighbourhood of an embedded metric graph) or pcf self‐similar fractals as metric measure spaces with ...
Post, Olaf, Simmer, Jan
openaire +2 more sources
Discrete Geodesic Distribution-Based Graph Kernel for 3D Point Clouds
Sensors, 2023 In the structural analysis of discrete geometric data, graph kernels have a great track record of performance. Using graph kernel functions provides two significant advantages.
Mehmet Ali Balcı +3 more
doaj +1 more source
Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
Journal of Mathematical Cryptology, 2009 Biggs has recently proposed the critical group of a certain class of finite graphs as a platform group for cryptosystems relying on the difficulty of the discrete log problem. The paper uses techniques from the theory of Picard groups on finite graphs to
Blackburn Simon R.
doaj +1 more source
Lietuvos Matematikos Rinkinys, 2021 Sturm-Liouville problem with nonlocal boundary conditions arises in many scientific fields such as chemistry, physics, or biology. There could be found some references to graph theory in a discrete Sturm-Liouville problem, especially in investigation of ...
Jonas Vitkauskas, Artūras Štikonas
doaj +1 more source
Discrete Hyperbolic Random Graph Model
CoRR, 2021 Accepted to SEA 2022.
Dorota Celinska-Kopczynska +1 more
openaire +4 more sources
Remarks on Dynamic Monopolies with Given Average Thresholds
Discussiones Mathematicae Graph Theory, 2015 Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and ...
Centeno Carmen C., Rautenbach Dieter
doaj +1 more source
Best Graph Type to Compare Discrete Groups: Bar, Dot, and Tally
Frontiers in Psychology, 2021 Different graph types might differ in group comparison due to differences in underlying graph schemas. Thus, this study examined whether graph schemas are based on perceptual features (i.e., each graph has a specific schema) or common invariant ...
Fang Zhao, Robert Gaschler
doaj +1 more source