Free Delivery Over $100
|
|
|||
|
||||
OverviewPlease note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. High Quality Content by WIKIPEDIA articles! An ErdA's-Diophantine graph is an object in the mathematical subject of Diophantine geometry consisting of a set of integer points at integer distances in the plane that cannot be extended by any additional points. Equivalently, it can be described as a complete graph with vertices located on the integer square grid Z such that all mutual distances between the vertices are integers, while all other grid points have a non-integer distance to at least one vertex. ErdA's-Diophantine graphs are named after Paul ErdA's and Diophantus of Alexandria. They form a subset of the set of Diophantine figures, which are defined as complete graphs in the Diophantine plane for which the length of all edges are integers. Thus, ErdA's-Diophantine graphs are exactly the Diophantine figures that cannot be extended. The existence of ErdA's-Diophantine graphs follows from the ErdA's-Anning theorem, Full Product DetailsAuthor: Lambert M. Surhone , Miriam T. Timpledon , Susan F. MarsekenPublisher: VDM Publishing House Imprint: VDM Publishing House Dimensions: Width: 22.90cm , Height: 0.60cm , Length: 15.20cm Weight: 0.159kg ISBN: 9786131197147ISBN 10: 6131197148 Pages: 100 Publication Date: 12 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 |
||||
