Minimum cycle base of graphs identified by two planar graphs

Minimum cycle base of graphs identified by two planar graphs

In 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. Also, we give a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of mathematical combinatorics 2007-10, Vol.1, p.59
Hauptverfasser: Ma, Dengju, Ren, Han
Format: Artikel
Sprache:eng
Schlagworte:
Evaluation
Graphic methods
Graphs
Topological spaces
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In 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. Also, we give a formula for calculating the length of minimum cycle base of a planar graph N(d,λ) defined in paper [11]. [PUBLICATION ABSTRACT]
ISSN:1937-1055
1937-1047