Additional Information
| Author(s) | Klesc, Marian, Kravecova, Daniela |
|---|
The crossing number of P2 5
Marian Klesc ♦ Daniela Kravecova
Abstract
creative_2008_17_3_431_438_abstractFull PDF
creative_2008_17_3_431_438Patil and Krishnnamurthy established family of graphs for which power graphs have crossing number one. This is the only result concerning crossing numbers of power of some graphs. Let P 2 m denote the power of the path Pm. We start to determine crossing numbers of a new in?nite family of graphs, concretely for the Cartesian products P 2 mCn wherem 2 and n 3. The main result of the paper is that the crossing number of the graph P2 5 Cn is 4n for all n 3.
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