Results 31 to 40 of about 6,790 (196)
Counting 2-circulant graphs [PDF]
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1985 AbstractAlspach and Sutcliffe call a graph X(S, q, F) 2-circulant if it consists of two isomorphic copies of circulant graphs X(p, S) and X(p, qS) on p vertices with “cross-edges” joining one another in a prescribed manner. In this paper, we enumerate the nonisomorphic classes of 2-circulant graphs X(S, q, F) such that |S| = m and |F| = k.
Chia, Gek-Ling, Lim, Chong-Keang
openaire +2 more sources
On 4-valent Frobenius circulant graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Sanming Zhou
doaj +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
Cohen–Macaulay Circulant Graphs [PDF]
Communications in Algebra, 2014 Let G be the circulant graph C n (S) with , and let I(G) denote the edge ideal in the ring R = k[x 1,…, x n ]. We consider the problem of determining when G is Cohen–Macaulay, i.e, R/I(G) is a Cohen–Macaulay ring. Because a Cohen–Macaulay graph G must be well-covered, we focus on known families of well-covered circulant graphs of the form C n (1, 2 ...
Kevin N. Vander Meulen +2 more
openaire +1 more source
On the Metric Index of Circulant Networks–An Algorithmic Approach
IEEE Access, 2019 A vertex v of a graph G uniquely determines (resolves) a pair (v1, v2) of vertices of G if the distance between v and v1 is different from the distance between v and v2.
Imran Khalid +2 more
doaj +1 more source
Solitaire clobber on circulant graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pará, Telma +2 more
openaire +1 more source
Almost self-complementary circulant graphs
Discrete Mathematics, 2004 The concept of an {almost self-complementary graph} has been introduced by B. Alspach to get around the restriction that the order of a self-complementary regular graph must be odd. An {almost complement} of a graph \(\Gamma\) of even order is a graph obtained by removing the edges of a 1-factor from the complement of \( \Gamma \).
Dobson, Edward, Šajna, Mateja
openaire +1 more source
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 +5 more
openaire +1 more source
Typical circulant double coverings of a circulant graph
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng, RQ, Kwak, JH
openaire +3 more sources