Results 31 to 40 of about 1,207,649 (297)
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
Exploring the Crossing Numbers of Three Join Products of 6-Vertex Graphs with Discrete Graphs
MathematicsThe significance of searching for edge crossings in graph theory lies inter alia in enhancing the clarity and readability of graph representations, which is essential for various applications such as network visualization, circuit design, and data ...
Michal Staš, Mária Švecová
doaj +1 more source
Discrete cubical and path homologies of graphs [PDF]
Algebraic Combinatorics, 2019 In this paper we study and compare two homology theories for (simple and undirected) graphs. The first, which was developed by Barcelo, Capraro, and White, is based on graph maps from hypercubes to the graph. The second theory was developed by Grigor’yan, Lin, Muranov, and Yau, and is based on paths in the graph. Results in both settings imply that the
Barcelo, Hélène +3 more
openaire +3 more sources
Efficient learning of discrete-continuous computation graphs [PDF]
, 2022 Numerous models for supervised and reinforcement learning benefit from combinations of discrete and continuous model components. End-to-end learnable discrete-continuous models are compositional, tend to generalize better, and are more interpretable.
Niepert, Mathias, Friede, David
core +1 more source
The Crossing Numbers of Join Products of All 5-Vertex Graphs with Discrete Graphs, Paths and Cycles
MathematicsThis paper investigates crossing numbers of join products involving all non-isomorphic graphs of order five and the graph families Dn, Pn, and Cn. By systematically examining all 34 graphs of order five, we establish a unified classification of 102 ...
Jana Fortes, Mária Timková
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
From the Crossing Numbers of K5 + Pn and K5 + Cn to the Crossing Numbers of Wm + Sn and Wm + Wn
AxiomsThe crossing number of a graph is a significant measure that indicates the complexity of the graph and the difficulty of visualizing it. In this paper, we examine the crossing numbers of join products involving the complete graph K5 with discrete graphs,
Michal Staš +2 more
doaj +1 more source
Cyclic Permutations in Determining Crossing Numbers
Discussiones Mathematicae Graph Theory, 2022 The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. Recently, the crossing numbers of join products of two graphs have been studied.
Klešč Marián, Staš Michal
doaj +1 more source
MARKOV GRAPHS OF ONE–DIMENSIONAL DYNAMICAL SYSTEMS AND THEIR DISCRETE ANALOGUES AND THEIR DISCRETE ANALOGUES [PDF]
Romanian Journal of Mathematics and Computer Science, 2016 One feature of the famous Sharkovsky’s theorem is that it can be proved using digraphs of a special type (the so–called Markov graphs). The most general definition assigns a Markov graph to every continuous map from the topological graph to itself.
SERGIY KOZERENKO
doaj
Quantum Graph Theory by Example [PDF]
QuantumQuantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right.
Gian Luca Spitzer, Ion Nechita
doaj +1 more source