Results 21 to 30 of about 6,790 (196)
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
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
On Dispersability of Some Circulant Graphs [PDF]
Journal of Graph Algorithms and Applications, 2022 20 pages, 14 figures, accepted for publication in the Journal of Graph Algorithms and ...
Kainen, Paul C. +2 more
openaire +3 more sources
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
Incidence and Laplacian matrices of wheel graphs and their inverses
The American Journal of Combinatorics, 2023 It has been an open problem to find the Moore-Penrose inverses of the incidence, Laplacian, and signless Laplacian matrices of families of graphs except trees and unicyclic graphs.
Jerad Ipsen, Sudipta Mallik
doaj +1 more source
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
Linear Algebra and its Applications, 2022 26 ...
Ivan Damnjanović, Dragan Stevanović
openaire +2 more sources
Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs
IEEE Access, 2021 The generalized recursive circulant networking can be widely used in the design and implementation of interconnection networks. It consists of a series of processors, each is connected through bidirectional, point-to-point communication channels to ...
Dun-Wei Cheng +2 more
doaj +1 more source