Cayley sum color and anti-circulant graphs
نویسندگان
چکیده
منابع مشابه
The metric dimension of circulant graphs and Cayley hypergraphs
Let G = (V,E) be a connected graph (or hypergraph) and let d(x, y) denote the distance between vertices x, y ∈ V (G). A subset W ⊆ V (G) is called a resolving set for G if for every pair of distinct vertices x, y ∈ V (G), there is w ∈ W such that d(x,w) 6= d(y, w). The minimum cardinality of a resolving set for G is called the metric dimension of G, denoted by β(G). In this paper we determine t...
متن کاملChrestenson Spectrum Computation Using Cayley Color Graphs
A method based on eigenvalue computations is formulated for computing the Chrestenson spectrum of a discrete p-valued function. This technique is developed by considering an extension to the same approach of computation of the Walsh spectrum for a twovalued function and is then generalized to the p-valued case. Algebraic groups are formulated that correspond to Cayley color graphs based on the ...
متن کاملCayley sum graphs and eigenvalues of (3, 6)-fullerenes
We determine the spectra of cubic plane graphs whose faces have sizes 3 and 6. Such graphs, “(3,6)-fullerenes”, have been studied by chemists who are interested in their energy spectra. In particular we prove a conjecture of Fowler, which asserts that all their eigenvalues come in pairs of the form {λ,−λ} except for the four eigenvalues {3,−1,−1,−1}. We exhibit other families of graphs which ar...
متن کاملCayley Color Graphs of Inverse Semigroups and Groupoids
The notion of Cayley color graphs of groups is generalized to inverse semigroups and groupoids. The set of partial automorphisms of the Cayley color graph of an inverse semigroup or a groupoid is isomorphic to the original inverse semigroup or groupoid. The groupoid of color permuting partial automorphisms of the Cayley color graph of a transitive groupoid is isomorphic to the original groupoid.
متن کاملCayley graphs - Cayley nets
It is, however, not clear how to choose the generators to produce special graphs. We know many topologies and their generators, but many more may be constructed in the future, having better properties (in terms of diameter, nodal degree and connectivity) than for instance the hypercube. I will present several graphs which connect rings using the generator g 1 and some additional generators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2015
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.10.031