Circuits in Complete Graphs and Their Relations to Rapidly-increasing Special Functions
John Matthew Dwyer · 2008
In graph theory, the number of circuits in a given graph is closely-related to special functions in mathematics, including the Gamma function г(x) and Reciprocal Beta function B(x,y). This paper investigates these rapidly- increasing functions and introduces a new function D(x,y), which provides a convenient means of evaluating in a single function the number of Hamilton and Euler circuits in a complete graph Kn. Provided that the publisher (Algana Associates) and the author remain clearly identified in each and every page, permission is hereby given that this publication may be produced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise. 4 © Algana Associates 2007