Results 31 to 40 of about 55,177 (267)
Labeled Embedding Of (n, n-2)-Graphs In Their Complements
Discussiones Mathematicae Graph Theory, 2017 Graph packing generally deals with unlabeled graphs. In [4], the authors have introduced a new variant of the graph packing problem, called the labeled packing of a graph. This problem has recently been studied on trees [M.A. Tahraoui, E.
Tahraoui M.-A. +2 more
doaj +1 more source
Cognitive Research, 2019 Visualizing data through graphs can be an effective way to communicate one’s results. A ubiquitous graph and common technique to communicate behavioral data is the bar graph.
Jessica K. Witt
doaj +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
A Java Application for Teaching Graphs in Undergraduate Courses
Applied Sciences, 2023 Graph theory is a common topic that is introduced as part of the curricula of computing courses such as Computer Science, Computer Engineering, Data Science, Information Technology and Software Engineering. Understanding graphs is fundamental for solving
Violeta Migallón, José Penadés
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
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
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
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
Acta Scientiarum: Technology, 2013 Higher homotopy of graphs has been defined in several articles. However, the existence of a long exact sequence associated to a pair (G, A) has not been touched at. We treat it here.
Mohamed Elamine Talbi, Djilali Benayat
doaj +1 more source
Upper a-Graphical Topological Spaces with the COVID-19 Form and Its Diffusion
AxiomsIn this work, we use the monophonic eccentric open neighborhood system and the upper approximation neighborhood system to construct a new class of topologies in the theory of undirected simple graphs.
Faten H. Damag +4 more
doaj +1 more source