Results 31 to 40 of about 332 (178)
Eternal domination and clique covering
Electronic Journal of Graph Theory and Applications, 2022 We study the relationship between the eternal domination number of a graph and its clique cove-ring number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt.
Gary MacGillivray +2 more
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
On 4-valent Frobenius circulant graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Sanming Zhou
doaj +1 more source
Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs
IEEE Access, 2021 The generalized recursive circulant networking can be widely used in the design and implementation of interconnection networks. It consists of a series of processors, each is connected through bidirectional, point-to-point communication channels to ...
Dun-Wei Cheng +2 more
doaj +1 more source
Layout of random circulant graphs [PDF]
Linear Algebra and its Applications, 2018 A circulant graph H is defined on the set of vertices V=\left\{ 1,\ldots,n\right\} and edges E=\left\{ \left(i,j\right):\left|i-j\right|\equiv s\left(\textrm{mod}n\right),s\in S\right\} , where S\subseteq\left\{ 1,\ldots,\lceil\frac{n-1}{2}\rceil\right\} . A random circulant graph results from deleting edges of H with probability 1-p.
Sebastian Richter, Israel Rocha
openaire +3 more sources
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
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
The irregularity strength of circulant graphs
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baril, Jean-Luc +2 more
openaire +2 more sources
Perfect matching transitivity of circulant graphs.
Electronic Journal of Graph Theory and Applications, 2022 A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M1 and M2 of G, there is an automorphism f : V(G)↦V(G) such that fe(M1)=M2, where fe(uv)=f(u)f(v).
Isaac Armando Reiter, Ju Zhou
doaj +1 more source
The Existence of Selfcomplementary Circulant Graphs
European Journal of Combinatorics, 1996 The authors determine the values of \(n\) for which there exist self-complementary circulant graphs of order \(n\).
Dalibor Froncek +2 more
openaire +1 more source