Results 101 to 110 of about 1,046 (212)
Mathematical Properties of the Hyperbolicity of Circulant Networks
Advances in Mathematical Physics, 2015 If X is a geodesic metric space and x1,x2,x3∈X, a geodesic triangle T={x1,x2,x3} is the union of the three geodesics [x1x2], [x2x3], and [x3x1] in X.
Juan C. Hernández +2 more
doaj +1 more source
Recognizing Recursive Circulant Graphs Abstract (Extended Abstract)
, 2000 Recursive circulant graphs G(N d) have been introduced in 1994 by Park and Chwa [PC94] as a new topology for interconnection networks. Recursive circulant graphs G(N d) are circulant graphs with N nodes and with jumps of powers of d.
Guillaume Fertin, Andre Raspaud
core
Frobenius circulant graphs of valency four [PDF]
, 2008 © 2008 Australian Mathematical Society. Online edition of the journal is available at http://journals.cambridge.org/JAZAbstract A first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group $K \rtimes H$ such that
Thomson, A, Zhou, S
core +1 more source
The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type [PDF]
, 2011 Approaching topics such as connected simple graph, k-partite graph, complete graph, tree, Smarandache (E1,E2)-number of ...
Junliang Cai +3 more
core +1 more source
Circulant Graphs And Tessellations On Flat Tori
, 2015 Circulant graphs are characterized here as quotient lattices, which are realized as vertices connected by a knot on a k-dimensional flat torus tessellated by hypercubes or hyperparallelotopes.
Costa S.I.R. +3 more
core +1 more source
Strong regularity and circulant graphs
Discrete Mathematics, 1989 Let p be a prime number. The paper characterizes a strong regular \(p^ k\)-circulant graph. Also, the paper gives a representation of Paley graphs of order \(p^ 2\). Specifically, it is shown that a \(p^ k\)- circulant graph is a nontrivial strongly regular graph if and only if \(k=1\) and it is isomorphic to the Paley graph of order p.
openaire +2 more sources
On the metric dimension of circulant graphs
Applied Mathematics Letters, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhammad Imran 0006 +3 more
openaire +1 more source
The number of spanning trees in odd valent circulant graphs
, 2004 In this paper, we consider the number of spanning trees in circulant graphs. For any class of odd valent circulant graphs C2n(a1,a2,…,ak−1,n), where a1,a2,…,ak−1 are fixed jumps and n varies, some formulas, asymptotic behaviors and linear recurrence ...
Chen, Xiebin, Lin, Qiuying, Zhang, Fuji
core +1 more source
Circulant graphs and tessellations on flat tori
, 2010 Circulant graphs are characterized here as quotient lattices, which are realized as vertices connected by a knot on a k-dimensional flat torus tessellated by hypercubes or hyperparallelotopes.
Carlos, T.B. +3 more
core +1 more source
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Svatopluk Poljak, Daniel Turzík
openaire +1 more source