Results 21 to 30 of about 975,970 (227)
Optimal circulant graphs as low-latency network topologies [PDF]
Journal of Supercomputing, 2022 Communication latency has become one of the determining factors for the performance of parallel clusters. To design low-latency network topologies for high-performance computing clusters, we optimize the diameters, mean path lengths, and bisection widths
Xiaolong Huang +2 more
semanticscholar +1 more source
Combinatorial refinement on circulant graphs [PDF]
Computational Complexity, 2022 The combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the number of refinement rounds is small, this puts the corresponding isomorphism problem in a low-complexity ...
Laurence Kluge
semanticscholar +1 more source
The minimal and maximal energies of all cubic circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2021 In recent article, Zhou and Zhou conjectured that among cubic circulant graphs with n vertices the maximum energy occurs whenever the largest number of components is attained.
Ilhan Hacioglu +2 more
doaj +1 more source
State transfer on integral mixed circulant graphs [PDF]
Discrete Mathematics, 2022 A mixed circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer (PST for short) and multiple state transfer (MST for ...
Xingwu Song, Huiqiu Lin
semanticscholar +1 more source
Quantum state transfer on integral oriented circulant graphs [PDF]
Applied Mathematics and Computation, 2022 An oriented circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer ($\PST$ for short) and multiple state transfer ...
Xingwu Song
semanticscholar +1 more source
Layout of random circulant graphs [PDF]
Linear Algebra and its Applications, 2018 A circulant graph H is defined on the set of vertices V=\left\{ 1,\ldots,n\right\} and edges E=\left\{ \left(i,j\right):\left|i-j\right|\equiv s\left(\textrm{mod}n\right),s\in S\right\} , where S\subseteq\left\{ 1,\ldots,\lceil\frac{n-1}{2}\rceil\right\} . A random circulant graph results from deleting edges of H with probability 1-p.
Sebastian Richter, Israel Rocha
openaire +3 more sources
Journal of Algebraic Combinatorics, 2023 We present a method which in principal allows to characterise all integral circulant graphs with multiplicative divisor set having a spectrum, i.e. the set of distinct eigenvalues, of any given size.
J. Sander, T. Sander
semanticscholar +1 more source
On the WL-dimension of circulant graphs of prime power order [PDF]
Algebraic Combinatorics, 2022 The WL-dimension of a graph X is the smallest positive integer m such that the m-dimensional Weisfeiler-Leman algorithm correctly tests the isomorphism between X and any other graph.
Ilia N. Ponomarenko
semanticscholar +1 more source
On Embeddings of Circulant Graphs [PDF]
The Electronic Journal of Combinatorics, 2015 A circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$, and as such, admits a transitive action of $\mathbb{Z}_n$ on its vertices. This paper concerns 2-cell embeddings of connected circulants on closed orientable surfaces.
Conder, Marston, Grande, Ricardo
openaire +3 more sources
Domination in Cayley graphs: A survey
AKCE International Journal of Graphs and Combinatorics, 2019 Let be a symmetric generating set of a finite group . Assume that be such that and satisfies the two conditions : the identity element and : if , then Given satisfying and define a Cayley graph with and .
T. Tamizh Chelvam, M. Sivagami
doaj +2 more sources