Results 31 to 40 of about 990 (211)
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
, 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
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
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
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
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
The Dataset for Optimal Circulant Topologies
Big Data and Cognitive Computing, 2023 This article presents software for the synthesis of circulant graphs and the dataset obtained. An algorithm and new methods, which increase the speed of finding optimal circulant topologies, are proposed.
Aleksandr Romanov
doaj +1 more source
The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type [PDF]
, 2011 Approaching topics such as connected simple graph, k-partite graph, complete graph, tree, Smarandache (E1,E2)-number of ...
Junliang Cai +3 more
core +1 more source
Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs
Mathematics, 2021 An automorphism of a graph is a mapping of the vertices onto themselves such that connections between respective edges are preserved. A vertex v in a graph G is fixed if it is mapped to itself under every automorphism of G. The fixing number of a graph G
Josephine Brooks +5 more
doaj +1 more source