Non-singular circulant graphs and digraphs
TL;DR: In this article, the singularity of a circulant graph C k and its complement graph C s,s,t is characterized, under certain conditions, and a slight generalization of these graphs are also studied.
Abstract: For a fixed positive integer n, let Wn be the permutation matrix corresponding to n defines a circulant graph C k. The results above are then applied to characterize its singularity, and that of its complement graph. The digraph Cr,s,t is defined as that whose adjacency matrix is circulant circ(a), where a is a vector with the first r-components equal to 1, and the next s,t and n− (r + s+ t) components equal to zero, one, and zero respectively. The singularity of this digraph (graph), under certain conditions, is also shown to depend algebraically upon these parameters. A slight generalization of these graphs are also studied.
Citations
More filters
TL;DR: In this paper, the Smith normal form of the adjacency matrix of each of the following graphs or their complements (or both): complete graph, cycle graph, square of the cycle, power graph of the graph, distance matrix graph of cycle, Andrasfai graph, Doob graph, cocktail party graph, crown graph, prism graph, Mobius ladder.
12 citations
References
More filters
Book•
01 Jan 1976
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
Abstract: (1977). Graph Theory with Applications. Journal of the Operational Research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
7,497 citations
TL;DR: In this paper, Popescu et al. discuss necessary and sufficient conditions for circulant matrices to be non-singular, and various distinct representations they have, goals that allow us to lay out the rich mathematical structure that surrounds them.
Abstract: Some mathematical topics, circulant matrices, in particular, are pure gems that cry out to be admired and studied with different techniques or perspectives in mind. Our work on this subject was originally motivated by the apparent need of one of the authors (IK) to derive a specific result, in the spirit of Proposition 24, to be applied in his investigation of theta constant identities [9]. Although progress on that front eliminated the need for such a theorem, the search for it continued and was stimulated by enlightening conversations with Yum-Tong Siu during a visit to Vietnam. Upon IK’s return to the US, a visit by Paul Fuhrmann brought to his attention a vast literature on the subject, including the monograph [4]. Conversations in the Stony Brook Mathematics’ common room attracted the attention of the other author, and that of Sorin Popescu and Daryl Geller∗ to the subject, and made it apparent that circulant matrices are worth studying in their own right, in part because of the rich literature on the subject connecting it to diverse parts of mathematics. These productive interchanges between the participants resulted in [5], the basis for this article. After that version of the paper lay dormant for a number of years, the authors’ interest was rekindled by the casual discovery by SRS that these matrices are connected with algebraic geometry over the mythical field of one element. Circulant matrices are prevalent in many parts of mathematics (see, for example, [8]). We point the reader to the elegant treatment given in [4, §5.2], and to the monograph [1] devoted to the subject. These matrices appear naturally in areas of mathematics where the roots of unity play a role, and some of the reasons for this to be so will unfurl in our presentation. However ubiquitous they are, many facts about these matrices can be proven using only basic linear algebra. This makes the area quite accessible to undergraduates looking for research problems, or mathematics teachers searching for topics of unique interest to present to their students. We concentrate on the discussion of necessary and sufficient conditions for circulant matrices to be non-singular, and on various distinct representations they have, goals that allow us to lay out the rich mathematical structure that surrounds them. Our treatement though is by no means exhaustive. We expand on their connection to the algebraic geometry over a field with one element, to normal curves, and to Toeplitz’s operators. The latter material illustrates the strong presence these matrices have in various parts of modern and classical mathematics. Additional connections to other mathematics may be found in [11]. The paper is organized as follows. In §2 we introduce the basic definitions, and present two models of the space of circulant matrices, including that as a
792 citations
14 citations
TL;DR: In this article, a family of connected graphs satisfying det(− A (G ))=−deg(G ) is constructed by constructing arbitrarily large families of graphs with determinant equal to that of the complete graph K n.
6 citations
TL;DR: In this paper, two classes of circulant graphs are studied, and conditions sufficient for these graphs to be nonsingular are established, i.e., the adjacency matrix A = A(G) is singular.
Abstract: A graph G is said to be singular when its adjacency matrix A = A(G) is singular, and circulant when A = A(G) is a circulant matrix. In this study, two classes of circulant graphs are studied, and conditions sufficient for these graphs to be nonsingular are established.
4 citations