Abstract.In this paper, we introduce some new theorems in connection with complete graphs. Firstly, we prove a fundamental theorem. Secondly, by that we obtain some interesting formulas for complete graphs. We study undirected graphs without loops or multiple edges.

Received: May 10, 2004

AMS Subject Classification: 68R10, 05C38

Key Words and Phrases: Euler number, complete graph, path, simple path

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2004
Volume: 15
Issue: 4