Research ArticleOpen accessPhrase in the titleNumber of Spanning Trees of Circulant Graphs C6n and their ApplicationsS. N. DaoudProblem statement: The number of spanning trees of a graph G is usually denoted by τ(G). A circulant graph with n vertices and k jumps is Cn (a1,…..,ak). Approach: In this study the number τ(G) of spanning trees of the circulant graphs C6n with some non-fixed jumps such as C6n (1, n), C6n (1, n, 2n), C6n (1, n, 3n), … …Journal of Mathematics and Statistics, Vol. 8, Issue 1 · 12 Dec 2011 · 7,626 accessesView PDFCite
Research ArticleOpen accessIn the keywordsCombinatorial Properties of Modified Chordal Rings Degree Four NetworksR. N. Farah, M. Othman, M. H. SelamatProblem statement: Modified Chordal Rings Degree Four, called CHRm4 is the first modified structure of chordal rings. This CHRm4 is an undirected circulant graph and is a double loop graph. Approach: This study presented the main properties of CHRm4. There are connectivity, Hamiltonian cycle and asymmetric. Results: Several definitions, postulates, corollary, theorems and lemmas were constructed according to these three … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 7,467 accessesView PDFCite