Results 1 to 10 of about 975,970 (227)

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   +2 more sources

HS-integral and Eisenstein integral mixed circulant graphs [PDF]

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   +2 more sources

On (r,c)-constant, planar and circulant graphs [PDF]

Discussiones Mathematicae Graph Theory
This paper concerns $(r,c)$-constant graphs, which are $r$-regular graphs in which the subgraph induced by the open neighbourhood of every vertex has precisely $c$ edges.
Yair Caro, Xandru Mifsud
doaj   +2 more sources

Fault-Tolerant Metric Dimension of Circulant Graphs

Mathematics, 2022
Let G be a connected graph with vertex set V(G) and d(u,v) be the distance between the vertices u and v. A set of vertices S={s1,s2,…,sk}⊂V(G) is called a resolving set for G if, for any two distinct vertices u,v∈V(G), there is a vertex si∈S such that d ...
Laxman Saha, Rupen Lama, Kalishankar Tiwary, Kinkar Chandra Das, Yilun Shang   +4 more
doaj   +2 more sources

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, Alvaro Carbonero, Joseph Vargas, Rigoberto Flórez, Brendan Rooney, Darren Narayan   +5 more
doaj   +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, Kai-Hsun Yao, Sun-Yuan Hsieh   +2 more
doaj   +2 more sources

The metric dimension of circulant graphs [PDF]

Opuscula Mathematica
A pair of vertices \(x\) and \(y\) in a graph \(G\) are said to be resolved by a vertex \(w\) if the distance from \(x\) to \(w\) is not equal to the distance from \(y\) to \(w\).
Tapendra BC, Shonda Dueck
doaj   +2 more sources

The local vertex anti-magic coloring for certain graph operations. [PDF]

Heliyon
This work proves the local vertex anti-magic coloring of even regular circulant bipartite graphs C(m;L). Let G be either Kr,r or Kr,r−F, F is a 1-factor.
Uma L, Rajasekaran G.
europepmc   +2 more sources

Open Locating-Dominating Sets in Circulant Graphs

Discussiones Mathematicae Graph Theory, 2022
Location detection problems have been studied for a variety of applications including finding faults in multiprocessors, contaminants in public utilities, intruders in buildings and facilities, and for environmental monitoring using wireless sensor ...
Givens Robin M., Yu Gexin, Kincaid Rex K.   +2 more
doaj   +2 more sources

On the classification and dispersability of circulant graphs with two jump lengths [PDF]

Discrete Applied Mathematics, 2023
In this paper, we give the classification of circulant graphs $C(\mathbb{Z}_{n},S)$ with $|S|=2$ and completely solve the dispersability of circulant graphs $C(\mathbb{Z}_{n},\{1, k\})$.
Xiaoxiang Yu, Zeling Shao, Zhiguo Li
semanticscholar   +1 more source