The crossing numbers of join products of paths with graphs of order four | Zendy

Marián Klešč | Zendy; Štefan Schrötter | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The crossing numbers of join products of paths with graphs of order four

Author(s) -

Marián Klešč,

Štefan Schrötter

Publication year - 2011

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1548

Subject(s) - join (topology) , mathematics , combinatorics , crossing number (knot theory) , order (exchange) , discrete mathematics , geography , business , intersection (aeronautics) , cartography , finance

Kulli and Muddebihal [V.R. Kulli, M.H. Muddebihal, Characterization of join graphs with crossing number zero, Far East J. Appl. Math. 5 (2001) 87–97] gave the characterization of all pairs of graphs which join product is planar graph. The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. There are only few results concerning crossing numbers of graphs obtained as join product of two graphs. In the paper, the exact values of crossing numbers for join of paths with all graphs of order four, as well as for join of all graphs of order four with n isolated vertices are given.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research