International Research journal of Management Science and Technology

  ISSN 2250 - 1959 (online) ISSN 2348 - 9367 (Print) New DOI : 10.32804/IRJMST

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 61    Submit Your Rating     Cite This   Download        Certificate

DUAL GRAPHS

    2 Author(s):  BAIDYANATH YADAV ,DR. K.K. CHOUDHARY

Vol -  8, Issue- 3 ,         Page(s) : 215 - 218  (2017 ) DOI : https://doi.org/10.32804/IRJMST

Abstract

A plane graph g partitions the rest of the plane into a number of connected regions, the closures of these regions are called the face of G, shows a plane graph with six faces f1, f2, f3, f4, f5 and f6. The notion of a face applies also to embeddings of graphs on other surfaces. We shall denote by F(G) and  (G), respectively, the set of faces and the number of faces of a plane graph G.

Demoucron, G,  Malgrange, Y. and  Pertuiset, R. (1964). Graphes  planaires:  reconnaissance  et  construction  de  representations  planries  topologiques. Rev.  Francaise  Rechaerche  Operationnelle, 8, 33-47
Fary, I. (1948). On  Straight  line  representation of  planar  graphs . Acta  Sci. Math. Szeged, 11, 222-33.
Gribnberg, E. Ja (1968).  Plane  homogeneous  graphs  of  degree three  without Hamiltonian circuits (Russian).  Latvian Math.  Yearbook, 4, 51-58.

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details