|
|
|||
|
||||
OverviewHigh Quality Content by WIKIPEDIA articles! In mathematics, a dual graph of a given planar graph G is a graph which has a vertex for each plane region of G, and an edge for each edge in G joining two neighboring regions, for a certain embedding of G. The term dual is used because this property is symmetric, meaning that if H is a dual of G, then G is a dual of H (if G is connected). The same notation of duality may also be used for more general embeddings of graphs on manifolds. Full Product DetailsAuthor: Lambert M. Surhone , Mariam T. Tennoe , Susan F. HenssonowPublisher: VDM Publishing House Imprint: VDM Publishing House Dimensions: Width: 22.90cm , Height: 0.60cm , Length: 15.20cm Weight: 0.176kg ISBN: 9786131258688ISBN 10: 6131258686 Pages: 112 Publication Date: 15 August 2010 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |