Results 121 to 130 of about 975,970 (227)
Colouring Clique-Hypergraphs of Circulant Graphs
Graphs and Combinatorics, 2008 A clique coloring of a graph \(G\) is a coloring of the vertices of \(G\) so that no maximal clique of size at least two is monochromatic. The clique hypergraph, \(\mathcal{H}(G)\), of a graph \(G\) has \(V(G)\) as its set of vertices and the maximal cliques of \(G\) as its hyperedges. A vertex coloring of \(\mathcal{H}(G)\) is a clique coloring of \(G\
Campos, C. N. +2 more
openaire +1 more source
Resolvability in Subdivision of Circulant Networks Cn1,k
Discrete Dynamics in Nature and Society, 2020 Circulant networks form a very important and widely explored class of graphs due to their interesting and wide-range applications in networking, facility location problems, and their symmetric properties.
Jianxin Wei +3 more
doaj +1 more source
The Existence of Selfcomplementary Circulant Graphs
European Journal of Combinatorics, 1996 The authors determine the values of \(n\) for which there exist self-complementary circulant graphs of order \(n\).
Fronček, Dalibor +2 more
openaire +1 more source
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
Further studies on circulant completion of graphs
Proyecciones (Antofagasta)A circulant graph C(n,S) is a graph having its adjacency matrix as a circulant matrix. It can also be intrepreted as a graph with vertices v0,v1,...,vn-1 that are in one to one correspondence with the members of Zn and with edge set {vivj:i-j ∈ S}, where
Toby B. Antony, S. Naduvath
semanticscholar +1 more source
Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip. [PDF]
Micromachines (Basel), 2023 Romanov AY +4 more
europepmc +1 more source
Singularly cospectral circulant graphs
Two graphs having the same spectrum are said to be cospectral. Two graphs such that the absolute values of their nonzero eigenvalues coincide are singularly cospectral graphs. Cospectrality implies singular cospectrality, but the converse may be false.
Conde, Cristian M. +3 more
openaire +2 more sources
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
On Solvable Groups and Circulant Graphs
European Journal of Combinatorics, 2000 Solvable graphs are defined to be graphs whose automorphism group contains a solvable subgroup. A circulant graph of order \(n\) has an automorphism group which contains an \(n\)-cycle. In this paper every vertex-transitive graph \(\Gamma\) of order \(n\) with \(\text{gcd}(n,\varphi(n))= 1\) is proved to be isomorphic to a circulant graph of order \(n\)
openaire +1 more source
Routing in circulant graphs based on a virtual coordinate system
Учёные записки Казанского университета: Серия Физико-математические наукиThis article explores routing methods in two-dimensional circulant graphs where each vertex is linked to four neighboring ones. The unique symmetries of the circulant graph make it a viable topology for high-performance computing devices, such as ...
A. M. Sukhov +2 more
doaj +1 more source