Results 11 to 20 of about 990 (211)
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.
Syed Ahtsham Ul Haq Bokhary +2 more
exaly +3 more sources
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
exaly +4 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
Algorithms, 2022 Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete ...
Ahmed El-Mesady +3 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
Enumerating typical abelian prime-fold coverings of a circulant graph
Discrete Mathematics, 2009 Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J.
Rongquan Feng +2 more
exaly +2 more sources
Typical circulant double coverings of a circulant graph
Discrete Mathematics, 2019 Several isomorphism classes of graph coverings of a graph G have been enumerated by many authors. Kwak and Lee (Canad. J. Math. XLII (1990) 747) enumerated the isomorphism classes of graph bundles and those of n-fold coverings with respect to a group of ...
Kwak, JH, Feng, RQ
core +4 more sources
Splines and Wavelets on Circulant Graphs [PDF]
Applied and Computational Harmonic Analysis, 2017 We present novel families of wavelets and associated filterbanks for the analysis and representation of functions defined on circulant graphs. In this work, we leverage the inherent vanishing moment property of the circulant graph Laplacian operator, and
Dragotti, PL, Kotzagiannidis, MS
core +5 more sources
Circulant double coverings of a circulant graph of valency five
Graphs and Combinatorics, 2018 Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory. A covering of G is called circulant if its covering graph is circulant.
Kwak, JH, Feng, RQ
core +4 more sources
Multiresolution graph signal processing via circulant structures
, 2013 We offer a new paradigm for multiresolution analysis and process-ing of graph signals using circulant structures. Among the essential features of circulant graphs is that they accommodate fundamental signal processing operations, such as linear shift ...
Babak Ayazifar, Kannan Ramchandran
exaly +2 more sources