Results 21 to 30 of about 332 (178)
Achromatic Numbers for Circulant Graphs and Digraphs
Discussiones Mathematicae Graph Theory, 2021 In this paper, we determine the achromatic and diachromatic numbers of some circulant graphs and digraphs each one with two lengths and give bounds for other circulant graphs and digraphs with two lengths.
Araujo-Pardo Gabriela +3 more
doaj +1 more source
HS-integral and Eisenstein integral mixed circulant graphs
Theory and Applications of Graphs, 2023 A mixed graph is called \emph{second kind hermitian integral} (\emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of the second kind are integers.
Monu Kadyan, Bikash Bhattacharjya
doaj +1 more source
Block circulant graphs and the graphs of critical pairs of crowns
Electronic Journal of Graph Theory and Applications, 2019 In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns.
Rebecca E. Garcia +3 more
doaj +1 more source
Asymptotic energy of connected cubic circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2021 In this article, we compute the oblique asymptote of the energy function for all connected cubic circulant graphs. Moreover, we show that this oblique asymptote is an upper bound for the energies of two of the subclasses of Möbius ladder graphs and lower
Alper Bulut, Ilhan Hacioglu
doaj +1 more source
On the Metric Dimension of Directed and Undirected Circulant Graphs
Discussiones Mathematicae Graph Theory, 2020 The undirected circulant graph Cn(±1, ±2, . . . , ±t) consists of vertices v0, v1, . . . , vn−1 and undirected edges vivi+j, where 0 ≤ i ≤ n − 1, 1 ≤ j ≤ t (2 ≤ t ≤ n2{n \over 2} ), and the directed circulant graph Cn(1, t) consists of vertices v0, v1, .
Vetrík Tomáš
doaj +1 more source
Splines and wavelets on circulant graphs [PDF]
Applied and Computational Harmonic Analysis, 2019 To appear in Appl. Comput. Harmon. Anal. (2017)
Kotzagiannidis, MS, Dragotti, PL
openaire +3 more sources
The hyperbolicity constant of infinite circulant graphs
Open Mathematics, 2017 If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
Rodríguez José M., Sigarreta José M.
doaj +1 more source
Maximum nullity and zero forcing of circulant graphs
Special Matrices, 2020 The zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and some inverse eigenvalue problems.
Duong Linh +4 more
doaj +1 more source
IEEE Access, 2020 For a family of optimal two-dimensional circulant networks with an analytical description, two new improved versions of the shortest path search algorithm with a constant complexity estimate are obtained.
Emilia A. Monakhova +2 more
doaj +1 more source