Results 21 to 30 of about 1,046 (212)
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
Resolvability in Subdivision Graph of Circulant Graphs
Symmetry, 2023 Circulant networks are a very important and widely studied class of graphs due to their interesting and diverse applications in networking, facility location problems, and their symmetric properties. The structure of the graph ensures that it is symmetric about any line that cuts the graph into two equal parts.
Syed Ahtsham Ul Haq Bokhary +5 more
openaire +1 more source
Integral mixed circulant graphs
Discrete Mathematics, 2023 A mixed graph is said to be \textit{integral} if all the eigenvalues of its Hermitian adjacency matrix are integer. The \textit{mixed circulant graph} $Circ(\mathbb{Z}_n,\mathcal{C})$ is a mixed graph on the vertex set $\mathbb{Z}_n$ and edge set $\{ (a,b): b-a\in \mathcal{C} \}$, where $0\not\in \mathcal{C}$.
Monu Kadyan, Bikash Bhattacharjya
openaire +3 more sources
, 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
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
Dissociation in circulant graphs and integer distance graphs
Discussiones Mathematicae Graph TheorySummary: A dissociation set of a graph \(G\) is a set of vertices which induces a subgraph of \(G\) with maximum degree at most 1, or equivalently, a set of vertices whose complement in \(G\) is a 3-path vertex cover (intersecting every 3-path of \(G)\).
Jia Huang
doaj +3 more sources
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
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
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