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
-
Power Domination in Generalized Mycielskian of Cycles
-
Fixed point theorem for composition of multivalued and single-valued mappings in Banach spaces
-
Initial Value Problem for Hybrid Improved Conformable Fractional Differential Equations with Retardation and Anticipation
-
On a Subclass of Meromorphic Functions Defined by a Differential Operator on Hilbert Space
-
Countably Many Positive Symmetric Solutions For Sturm Liouville Type Boundary Conditions Of Second Order Iterative System
-
On the derived numbers of a real function
-
Some considerations about l'Hôpital-type rules for the monotonicity
-
On Minimum Second neighborhood Degree Energy of Graphs
-
Preserver Problems on Infinite Divisibility and Separability
-
A Note on Moritoh Transforms