Results 101 to 110 of about 1,684,687 (171)

Further studies on circulant completion of graphs

open access: yes
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
Antony, Tony, Naduvath, Sudev
core   +1 more source

Characteristic Polynomials and Spectra of Some Block Circulant Graphs

open access: yes, 2013
NSFC [11171279, 11171134]A block matrix A=(Aij ) nxn is called a block circulant matrix, denoted by C(A 11, A 12, ..., A 1n ) if Aij =A 1,ji+1 for all 1i, jn, where Aij is a matrix and ji+1 is taken modulo n.
Wang Hongbo, 王洪波, Guo Xiaofeng
core  

Circulant weighing designs

open access: yes, 1996
Algebraic techniques are employed to obtain necessary conditions for the existence of certain families of circulant weighing designs. As an application we rule out the existence of many circulant weighing designs.
Jennifer Seberry (19583125)   +1 more
core  

General properties of c-circulant digraphs

open access: yes
A digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with general properties of this family of digraphs, as isomorphisms, regularity, strong connectivity, diameter and the relation between c-circulant digraphs ...
Fiol Mora, Miquel Àngel   +2 more
core  

Extension of the Fundamental Theorem of Algebra for Polynomial Matrix Equations with Circulant Matrices

open access: yes
We establish an analogue of the fundamental theorem of algebra for polynomial matrix equations, in which the matrices-coefficients and unknown matrix are assumed to be circulant matrices.5 pages, to appear in the American Mathematical Monthly in ...
Abramov, Vyacheslav M.
core   +1 more source

Home - About - Disclaimer - Privacy