Results 111 to 120 of about 1,046 (212)
Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
Electronic Journal of Graph Theory and Applications, 2014 This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large graphs with given degree and diameter.
Hebert Perez-Roses
doaj +1 more source
Minimum chromaticity of circulant graphs
, 2005 We determine families of circulant graphs for which each graph G=Gc(n;S) has chromatic number χ(G)⩽3. In particular, we show that there exists an n0 such that χ(G)⩽3 for all n⩾n0 whenever S={s1,s2,…,sk} and sk>sk-1>⋯>s1 and 2s1>sk or S={s1,s2} and s2>s1 ...
Peters, Joseph +2 more
core +1 more source
On the Ádám Property for Circulant Graphs
, 1996 We investigate conditions for isomorphism between circulant graphs and analyze their automorphism group, with special emphasis on loop networks. We give a survey of pertinent published results and answer partially a long-standing conjecture [5] that all ...
Bruce Litow, Bernard Mans
core
Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip. [PDF]
Micromachines (Basel), 2023 Romanov AY +4 more
europepmc +1 more source
Graphs with circulant adjacency matrices
, 1970 Properties of a graph (directed or undirected) whose adjacency matrix is a circulant are studied. Examples are given showing that the connection set determined by the first row of such a matrix need not be multiplicatively related to the connection set ...
Turner, James, Elspas, Bernard
core +1 more source
On the page-number of a circulant graph
AKCE International Journal of Graphs and CombinatoricsThe page-number of a graph G, denoted by p(G), is the minimum k such that G has an embedding in a k-book. The circulant graph C(m, n) is such a graph that its vertex set is [Formula: see text] and edge set is [Formula: see text], where m, n are positive integers satisfying [Formula: see text] and indices is read modulo m.
Xiaoyuan Dong, Dengju Ma
openaire +2 more sources
On Isospectral Integral Circulant Graphs
, 2023 Understanding when two non-isomorphic graphs can have the same spectra is a classic problem that is still not completely understood, even for integral circulant graphs.
Zhang, Yan X
core
On the symmetries of some classes of recursive circulant graphs
Transactions on Combinatorics, 2014 A recursive-circulant $G(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$G(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties.
Seyed Morteza Mirafzal
doaj
Quantum state transfer on integral oriented circulant graphs
, 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 ...
Song, Xing-Kun
core
On Edge Transitive Circulant Graphs
Tokyo Journal of Mathematics, 1996 This paper classifies those circulant graphs for which both the graph and its complement are edge-transitive. The author shows that such a graph must be either a disjoint union of copies of a complete graph, or the complement of such a disjoint union, or a Paley graph on a prime number of vertices.
openaire +3 more sources