7 research outputs found
Minimum Cycle Base of Graphs Identified by Two Planar Graphs
Get PDFIn this paper, we study the minimum cycle base of the planar graphs obtained
from two 2-connected planar graphs by identifying an edge (or a cycle) of one graph with the corresponding edge (or cycle) of another, related with map geometries, i.e., Smarandache 2-dimensional manifolds
The crossing number of the circular graph C(2m+2,m) ∗
No full textThe circular graph C(n, m) is such a graph that whose vertex set is {v0, v1, v2, · · · , vn−1} and edge set is {vivi+1, vivi+m | i = 0, 1, · · · , n − 1}, where m, n are natural numbers, addition is modulo n, and 2 ≤ m ≤ ⌊ n 2 ⌋. This paper shows the crossing number of the circular graph C(2m + 2, m)(m ≥ 3) is m + 1. Key Words: crossing number, circular graph, automorphism. AMS Subject Classification: O5C1
The crossing number of the circular graph <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi mathvariant="normal">C</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
No full text
