Results 11 to 20 of about 590,064 (163)
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 +5 more sources
Well-covered circulant graphs [PDF]
Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jason I. Brown, Richard Hoshino
openaire +4 more sources
Stability of circulant graphs [PDF]
Journal of Combinatorial Theory, Series B, 2019 The canonical double cover $\mathrm{D}(Γ)$ of a graph $Γ$ is the direct product of $Γ$ and $K_2$. If $\mathrm{Aut}(\mathrm{D}(Γ))=\mathrm{Aut}(Γ)\times\mathbb{Z}_2$ then $Γ$ is called stable; otherwise $Γ$ is called unstable. An unstable graph is nontrivially unstable if it is connected, non-bipartite and distinct vertices have different neighborhoods.
Yan-Li Qin, Binzhou Xia, Sanming Zhou
openaire +2 more sources
On the decomposition of circulant graphs using algorithmic approaches
Alexandria Engineering Journal, 2022 Many structural models in chemistry, biology, computer science, sociology, and operations research can be analyzed using graph theory. Some examples of these structure models are species movement between regions, molecular bonds, shortest spanning trees,
A. El-Mesady, Y.S. Hamed, H. Shabana
doaj +1 more source
The minimal and maximal energies of all cubic circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2021 In recent article, Zhou and Zhou conjectured that among cubic circulant graphs with n vertices the maximum energy occurs whenever the largest number of components is attained.
Ilhan Hacioglu +2 more
doaj +1 more source
Domination in Cayley graphs: A survey
AKCE International Journal of Graphs and Combinatorics, 2019 Let be a symmetric generating set of a finite group . Assume that be such that and satisfies the two conditions : the identity element and : if , then Given satisfying and define a Cayley graph with and .
T. Tamizh Chelvam, M. Sivagami
doaj +2 more sources
Sum coloring of distance and circulant graphs
, 2005 International audienceA distance graph (resp. circulant graph) is a graph obtained from the path (resp. the cycle) of order n by adding chordal edges between any pair of vertices at distance d\in D, D\subseteq Zn.
Kheddouci, Hamamache, Effantin, Brice
core +9 more sources
Electronic Journal of Graph Theory and Applications, 2021 A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G is called a circulant if its automorphism group contains a |V(G)|-cycle.
Zbigniew R. Bogdanowicz
doaj +1 more source
, 2022 Circulant topologies with different generators count (2-10). This is a dataset consisting of signatures of optimal circulant topologies for various parameters. Circulants are regular topologies based on the Cayley graphs of a cyclic group.
A. Y. Romanov
core +1 more source
The spectrum on prism graph using circulant matrix [PDF]
, 2022 Spectral graph theory discusses about the algebraic properties of graphs based on the spectrum of a graph. This article investigated the spectrum of prism graph. The method used in this research is the circulant matrix.
Triyani, Triyani +3 more
core +1 more source