Results 131 to 140 of about 590,064 (163)
Spatial circular matrices, with applications [PDF]
The cumulants of the quadratic forms associated to the so-called spatial design matrices are often needed for inference in the context of isotropic processes on uniform grids.
Federico Martellosio, Grant Hillier
core
The metric dimension of the circulant graph C(n,±{1,2,3,4})
, 2019 Let = (,) be a connected graph and let (,) denote the distance between vertices ,∈. A metric basis for is a set ⊆ of minimum cardinality such that no two vertices of have the same distances to all points of .
Kalinowski, Thomas +3 more
core
Circulant Double Coverings of a Circulant Graph of Valency Four
Graphs and Combinatorics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin Ho Kwak, Rongquan Feng
exaly +6 more sources
Enumerating typical abelian prime-fold coverings of a circulant graph [PDF]
Discrete Mathematics, 2009 Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J.
Young Soo Kwon +2 more
exaly +2 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 +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 +4 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 +2 more sources
Total colorings of circulant graphs
Discrete Mathematics, Algorithms and Applications, 2020The total chromatic number [Formula: see text] is the least number of colors needed to color the vertices and edges of a graph [Formula: see text] such that no incident or adjacent elements (vertices or edges) receive the same color. Behzad and Vizing proposed a well-known total coloring conjecture (TCC): [Formula: see text], where [Formula: see text]
J. Geetha 0001 +2 more
openaire +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
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 +2 more
openaire +2 more sources