Results 121 to 130 of about 590,064 (163)
On planarity and colorability of circulant graphs
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Cycling properties of circulant graphs
, 2022 Tato práce se věnuje cyklickým vlastnostem cirkulačních grafů. Především je zaměřena na pancyklicitu cirkulantů. Mějme dána kladná celá čísla 0 < a_1 < a_2 < ... < a_k
Rečková, Alena
core
PMC-LABELING OF SOME CLASSES OF GRAPHS CONTAINING CYCLES
BarekengLet be a graph with p vertices and q edges. We have introduced a new graph labeling method using integers and cordial-related works and investigated some graphs for this labeling technique.
R Ponraj, S Prabhu, M Sivakumar
doaj +1 more source
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
On magic and supermagic circulant graphs
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Circulant Graphs And Spherical Codes
, 2015 Circulant graphs are homogeneous graphs with special properties which have been used to build interconnection networks for parallel computing.
Muniz M. +3 more
core +1 more source
Perfect codes in circulant graphs of degree $p^l-1$ [PDF]
A perfect code in a graph is an independent set of the graph such that every vertex outside the set is adjacent to exactly one vertex in the set. A circulant graph is a Cayley graph of a cyclic group.
Wang, Xiaomeng +3 more
core
Graph Homomorphism Revisited for Graph Matching [PDF]
, 2010 In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
Some new optimal and suboptimal infinite families of undirected double-loop networks
Discrete Mathematics & Theoretical Computer Science, 2006 Let n, s be positive integers such that 2≤s<n and s≠ n / 2. An undirected double-loop network G(n; 1, s) is an undirected graph (V, E), where V = ℤ n = {0, 1, 2, …, n-1 } and E = { (i, i+1 mod n), (i, i+s mod n) | i ∈ℤ}.
Bao Xing Chen +2 more
doaj
On the Weisfeiler-Leman dimension of circulant graphs
A circulant graph is a Cayley graph of a finite cyclic group. The Weisfeiler-Leman-dimension of a circulant graph $X$ with respect to the class of all circulant graphs is the smallest positive integer~$m$ such that the $m$-dimensional Weisfeiler-Leman ...
Wu, Yulai, Ponomarenko, Ilia
core