Results 181 to 190 of about 1,046 (212)
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wasin So
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Gorenstein circulant graphs
Discrete Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ashkan Nikseresht, Mohammad Reza Oboudi
openaire +1 more source
Generalized Recursive Circulant Graphs
IEEE Transactions on Parallel and Distributed Systems, 2012In this paper, we propose a new class of graphs called generalized recursive circulant graphs which is an extension of recursive circulant graphs. While retaining attractive properties of recursive circulant graphs, the new class of graphs achieve more flexibility in varying the number of vertices. Some network properties of recursive circulant graphs,
Shyue-Ming Tang, Yue-Li Wang
exaly +2 more sources
On Routing in Circulant Graphs
1999We investigate various problems related to circulant graphs- finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These problems are related to short- est vector problems in a special class of lattices. We give matching upper and lower bounds on the length of the shortest loop.
Jin-yi Cai +5 more
openaire +2 more sources
On the chromatic number of circulant graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oriol Serra
exaly +2 more sources
Some Invariants of Circulant Graphs [PDF]
Symmetry, 2016 Topological indices and polynomials are predicting properties like boiling points, fracture toughness, heat of formation, etc., of different materials, and thus save us from extra experimental burden. In this article we compute many topological indices for the family of circulant graphs.
Mobeen Munir +2 more
exaly +2 more sources
Pancyclicity of recursive circulant graphs
Information Processing Letters, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toru Araki, Yukio Shibata
exaly +3 more sources
Star Extremal Circulant Graphs
SIAM Journal on Discrete Mathematics, 1999A graph is said to be star extremal if its fractional chromatic number is equal to its circular chromatic number. In this paper, it is proven that some families of circulant graphs are star extremal. The results generalize some earlier results obtained by \textit{A. F. Sidorenko} [Discrete Math.
Ko-Wei Lih +2 more
openaire +1 more source
On the chromatic number of integral circulant graphs
Computers and Mathematics With Applications, 2010 Integral circulant graphs are a generalization of unitary Cayley graphs, recently studied by Klotz and Sander. The integral circulant graph Xn(D) has vertices 0,1,…,n−1, and two vertices a and b are adjacent iff gcd(x−y,n)∈D, where D⊆{d:d∣n,1 ...
Aleksandar Ilić, Milan Basic
exaly +2 more sources
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), 2002
A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for ...
openaire +1 more source
A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for ...
openaire +1 more source