Results 61 to 70 of about 1,286,422 (323)
ON THE CROSSING NUMBER OF THE JOIN OF FIVE VERTEX GRAPH WITH THE DISCRETE GRAPH Dn [PDF]
Acta Electrotechnica et Informatica, 2017 In this paper, we show the values of crossing numbers for join products of graph G on five vertices with the discrete graph Dn and the path Pn on n vertices. The proof is done with the help of software. The software generates all cyclic permutations for
Štefan BEREŽNÝ, Michal STAŠ
doaj +1 more source
The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five
Mathematics, 2021 The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K1,1,3\e obtained by removing one edge e incident with some ...
Michal Staš
doaj +1 more source
Graphs and Combinatorics, 2018 Let $$F_q$$ be the field of size q and SL(n, q) be the special linear group of order n over the field $$F_q$$
Ku, Cheng Yeaw, Wong, Kok Bin
openaire +3 more sources
Improvement on the Decay of Crossing Numbers [PDF]
Graphs and Combinatorics, 2008 7 pages, 1 ...
Jakub Černý, Jan Kynčl, Géza Tóth
openaire +5 more sources
On the Problems of
MathematicsA connected graph, G, is Crossing Free-connected (CF-connected) if there is a path between every pair of vertices with no crossing on its edges for each optimal drawing of G.
Michal Staš, Mária Timková
doaj +1 more source
A Note on the Crossing Numbers of 5-Regular Graphs
Discussiones Mathematicae Graph Theory, 2020 The crossing number cr(G) of a graph G is the smallest number of edge crossings in any drawing of G. In this paper, we prove that there exists a unique 5-regular graph G on 10 vertices with cr(G) = 2.
Ouyang Zhangdong
doaj +1 more source
Fixed parameter tractability of crossing minimization of almost-trees
, 2013 We investigate exact crossing minimization for graphs that differ from trees by a small number of additional edges, for several variants of the crossing minimization problem.
Bannister, Michael J. +2 more
core +1 more source
On the 2-Colored Crossing Number [PDF]
, 2019 Let $D$ be a straight-line drawing of a graph. The rectilinear 2-colored crossing number of $D$ is the minimum number of crossings between edges of the same color, taken over all possible 2-colorings of the edges of $D$. First, we show lower and upper bounds on the rectilinear 2-colored crossing number for the complete graph $K_n$.
Oswin Aichholzer +6 more
openaire +2 more sources
The Crossing Number of the Cone of a Graph [PDF]
SIAM Journal on Discrete Mathematics, 2016 Motivated by a problem asked by Richter and by the long standing Harary-Hill conjecture, we study the relation between the crossing number of a graph $G$ and the crossing number of its cone $CG$, the graph obtained from $G$ by adding a new vertex adjacent to all the vertices in $G$.
Marek Derňár +3 more
openaire +3 more sources
Population Ecology, EarlyView.Population size and dynamics fundamentally shape speciation by influencing genetic drift, founder events, and adaptive potential. Small populations may speciate rapidly due to stronger drift, whereas large populations harbor more genetic diversity, which can alter divergence trajectories. We highlight theoretical models that incorporate population size
Ryo Yamaguchi +3 more
wiley +1 more source