ku42303 - Publications List

Faculty of Engineering, Kingston University
Friars Avenue 
Roehampton Vale
London SW15 3DW 
UK

ku42303@kingston.ac.uk

Home page

Professor of Computer Engineering teaching mainly engineering students at Kingston University from all areas, including Mechanical, Civil and Aerospace.

Experience at previous engineering institutions includes City Univ. (UK), City Univ. (US), Iona College (US), Richmond American University (UK), Sheffield Hallam Univ. (UK), South Bank Univ. (UK), St John Fisher College (US) and Univ. of Westminster (UK).

Experienced undergraduate (BEng, BSc and FSc) and postgraduate (MSc, MPhil and PhD) external examiner.

Qualifications: BSc, MSc, PhD, FIET, CEng


Technical reports

2008	J Dwyer (2008) Counting the Number of Euler Circuits in Complete Graphs ALGANA Research Papers in Algorithm Analysis http://www.algana.co.uk/Research/research.html: Abstract: 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. Notes: http://www.algana.co.uk/Research/Circuits.pdf
	J Dwyer (2008) Circuits in Complete Graphs and Their Relations to Rapidly-increasing Special Functions ALGANA Research Papers in Algorithm Analysis http://www.algana.co.uk/Research/research.html: Abstract: 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-1(x,y). This paper investigates these rapidlyincreasing 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. Notes: http://www.algana.co.uk/Research/Counting.pdf

Technical reports