Results 31 to 40 of about 8,162 (190)
Linear Algebra and its Applications, 2022 26 ...
Ivan Damnjanović, Dragan Stevanović
openaire +2 more sources
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 the Metric Dimension of Directed and Undirected Circulant Graphs
Discussiones Mathematicae Graph Theory, 2020 The undirected circulant graph Cn(±1, ±2, . . . , ±t) consists of vertices v0, v1, . . . , vn−1 and undirected edges vivi+j, where 0 ≤ i ≤ n − 1, 1 ≤ j ≤ t (2 ≤ t ≤ n2{n \over 2} ), and the directed circulant graph Cn(1, t) consists of vertices v0, v1, .
Vetrík Tomáš
doaj +1 more source
Incidence and Laplacian matrices of wheel graphs and their inverses
The American Journal of Combinatorics, 2023 It has been an open problem to find the Moore-Penrose inverses of the incidence, Laplacian, and signless Laplacian matrices of families of graphs except trees and unicyclic graphs.
Jerad Ipsen, Sudipta Mallik
doaj +1 more source
The eigenvalues and energy of integral circulant graphs [PDF]
Transactions on Combinatorics, 2012 A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency matrix is circulant. Let $D$ be aset of positive, proper divisors of the integer $n>1$.
Mohsen Mollahajiaghaei
doaj
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
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
Structure and substructure connectivity of circulant graphs and hypercubes [PDF]
Arab Journal of Mathematical Sciences, 2021 Let H be a connected subgraph of a connected graph G. The H-structure connectivity of the graph G, denoted by κ(G;H), is the minimum cardinality of a minimal set of subgraphs F={H1′,H2′,…,Hm′} in G, such that every H′i∈F is isomorphic to H and removal of
T. Tamizh Chelvam, M. Sivagami
doaj +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