Results 31 to 40 of about 8,142 (196)
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
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
The minimum rank problem for circulants
, 2015 The minimum rank problem is to determine for a graph $G$ the smallest rank of a Hermitian (or real symmetric) matrix whose off-diagonal zero-nonzero pattern is that of the adjacency matrix of $G$.
Deaett, Louis, Meyer, Seth A.
core +1 more source
On Adjacency Metric Dimension of Some Families of Graph
Journal of Function Spaces, 2022 Metric dimension of a graph is a well-studied concept. Recently, adjacency metric dimension of graph has been introduced. A set Qa⊂VG is considered to be an adjacency metric generator for G if u1,u2∈V\Qa (supposing each pair); there must exist a vertex q∈
Ali N. A. Koam +4 more
doaj +1 more source