Results 1 to 10 of about 410 (178)
On the page-number of a circulant graph
AKCE International Journal of Graphs and CombinatoricsThe page-number of a graph G, denoted by p(G), is the minimum k such that G has an embedding in a k-book. The circulant graph C(m, n) is such a graph that its vertex set is [Formula: see text] and edge set is [Formula: see text], where m, n are positive ...
Xiaoyuan Dong, Dengju Ma
doaj +4 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
exaly +2 more sources
Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs [PDF]
HeliyonLet Q be a polynomial ring over a field F and I be an edge ideal associated with the whisker graph of a cubic circulant graph. We discuss the regularity, depth, Stanley depth, and projective dimension of Q/I.
Mujahid Ullah Khan Afridi +2 more
doaj +2 more sources
Routing in triple loop circulants: A case of networks-on-chip [PDF]
Heliyon, 2020 In this paper we propose and analyze various approaches to organizing routing in a triple loop circulant topologies as applied to networks-on-chip: static routing based on universal graph search algorithms, such as Dijkstra's algorithm and a possible ...
Aleksandr Yu. Romanov +1 more
doaj +2 more sources
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wasin So
exaly +3 more sources
Typical circulant double coverings of a circulant graph
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin Ho Kwak, Rongquan Feng
exaly +4 more sources
Irregular labelings of circulant graphs
Discrete Mathematics, 2012 Let \(G=(V,E)\) be an edge-labeled graph with \(w(e)>0\) being an integer for each edge \(e\in E\). Then the weighted degree \(wd(v)\) of a vertex \(v\in V\) is given by \(wd(v)=\sum_{e\backepsilon v}w(e)\). The edge labeling is called irregular if all vertices in \(V\) have distinct weighted degrees; and the smallest \(s\) so that there exists an ...
Marcin Anholcer, Cory Palmer
exaly +3 more sources
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 ...
Paul C. Kainen +2 more
openaire +3 more sources
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
Alexandria Engineering Journal, 2022 Graph theory is a powerful and essential tool for applied scientists and engineers in analyzing and designing algorithms for several problems. Graph theory has a vital role in complex systems, especially in computer sciences. Applications of graph theory
A. El-Mesady +2 more
doaj +1 more source