Photo from wikipedia
The crossing number of a graph G, cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. There are almost no results… Click to show full abstract
The crossing number of a graph G, cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. There are almost no results concerning crossing number of join of a disconnected 6-vertex graph with cycle. The main aim of this paper is to give the crossing number of the join product Q+Cn for the disconnected 6-vertex graph Q consisting of the two 3-cycles, where Cn is the cycle on n vertices.
Keywords:
disconnected vertex;
number;
vertex graph;
crossing number;
number join
Journal Title: Mathematics
Year Published: 2023
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Mathematics
Year Published: 2023
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!