Additional Information
| Author(s) | Draženská , EmÃlia |
|---|
The crossing numbers of products of paths with 7–vertex trees
EmÃlia Draženská
Abstract
creative_2014_23_2_191_197_abstractThe crossing numbers of Cartesian products of paths with all graphs of order at most five are given. The crossing numbers of Cartesian products of paths with several graphs on six vertices are known. We extend these results by giving the exact values or upper bound of crossing numbers of Cartesian products G□PnG◻Pn for every tree GG on seven vertices.
Recently posted
-
Uniqueness of Shift Polynomials and Derivative Sharing Polynomial
-
Diffeomorphic embedding of Higher-dimensional Hilbert Manifolds into Hilbert spaces
-
Approximating fixed points of the SP*-iteration for generalized nonexpansive mappings in CAT(0) spaces
-
Leverage Centrality in Corona Product of Cycle with some Graphs
-
Some new results on WS-algebras
-
On Duo Γ-semihyperrings
-
Comparative Study of Different Vacation Schemes in an Inventory System with Production and Multiple Servers
-
Isomorphism of Line Graph and Common Neighbourhood Graph
-
Timelike Bonnet surfaces on Lorentzian three-manifolds
-
Nonassociative van der Waerden rings