Counting the Number of Euler Circuits in Complete Graphs
by ac3bf1 on May.29, 2008, under Papers & Research
Abstract
In graph theory, a long standing problem has involved finding
a closed form expression for the number of Euler circuits in
Kn. The solution presented here comprises a function D(x,y)
that has several interesting applications in computing.
Author: Professor John Dwyer
-
Welcome to my Blog!
Thanks for dropping by! Feel free to leave comments on anything you find useful... You can stay updated by subscribing to the RSS feed, you can contact me by using the contact page, or you can Follow me on Twitter
Latest Tweets
- I'm at Be Project (Via Giovanni Severano 15, Rome)
http://t.co/9I7x1S8T - Ryanair's new motto: "doing our best to make your flight miserable!" @ryanairnews @flyryanair #RyanAir
- Everything You Thought You Knew About Learning Is Wrong via @zite
http://t.co/oBhh3BKh
- I'm at Be Project (Via Giovanni Severano 15, Rome)
